Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 25
Volume 25, Numbers 1-2, October 1989
- Uri N. Peled:
Preface. 1 - Richard A. Brualdi, Vera Pless:
Polyadic codes. 3-17 - Jian-Er Chen:
A new complete language for DSPACE(log n). 19-26 - Karen L. Collins:
On a conjecture of Graham and Lovász about distance matrices. 27-35 - Paul Erdös, András Hajnal:
Ramsey-type theorems. 37-52 - Aviezri S. Fraenkel, Mordechai Lorberbom:
Epidemiography with various growth functions. 53-71 - Shmuel Friedland:
Coherent algebras and the graph isomorphism problem. 73-98 - William M. Kantor:
Some Cayley graphs for simple groups. 99-104 - Louis H. Kauffman:
A Tutte polynomial for signed graphs. 105-127 - Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski:
On the variance of the external path length in a symmetric digital trie. 129-143 - Michael G. Main:
Detecting leftmost maximal periodicities. 145-153 - Xiaojun Shen, Y. Z. Cai, C. L. Liu, Clyde P. Kruskal:
Generalized latin squares I. 155-178 - Vijay V. Vazirani, Mihalis Yannakakis:
Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs. 179-190
Volume 25, Number 3, November 1989
- David W. Ash
, Ian F. Blake, Scott A. Vanstone:
Low complexity normal bases. 191-210 - Soo Y. Chang, Katta G. Murty:
The steepest descent gravitational method for linear programming. 211-239 - Nachum Dershowitz, Shmuel Zaks:
Patterns in trees. 241-255 - Yehoshua Perl:
Better understanding of batcher's merging networks. 257-271 - Nicholas Pippenger:
Knots in random walks. 273-278 - Moshe Rosenfeld:
On spanning subgraphs of 4-connected planar graphs. 279-287 - Edward R. Scheinerman, John C. Wierman:
Optimal and near-optimal broadcast in random graphs. 289-297 - Andrew Vince:
Scheduling periodic events. 299-310 - Pentti Hämäläinen:
The absolute center of a unicyclic network. 311-315 - S. S. Ravi:
On the orderability problem for PLA folding. 317-320 - Wei-Kuan Shih, Wen-Lian Hsu:
An O(n1.5) algorithm to color proper circular arcs. 321-323
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
