Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. ACM AND YEAR=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Stability of binary exponential backoff
Jonathan Goodman
,
Albert G. Greenberg
,
Neal Madras
,
Peter March
Journal of the ACM
35
(3), 1988, pp. 579-602
The physical mapping problem for parallel architectures
Lenwood S. Heath
,
Arnold L. Rosenberg
,
Bruce T. Smith
Journal of the ACM
35
(3), 1988, pp. 603-634
Optimal simulations between mesh-connected arrays of processors
S. Rao Kosaraju
,
Mikhail J. Atallah
Journal of the ACM
35
(3), 1988, pp. 635-650
The parallel complexity of exponentiating polynomials over finite fields
Faith E. Fich
,
Martin Tompa
Journal of the ACM
35
(3), 1988, pp. 651-667
Busy periods for subnetworks in stochastic networks: Mean value analysis
Hans Daduna
Journal of the ACM
35
(3), 1988, pp. 668-674
The reduction of perturbed Markov generators: An algorithm exposing the role of transient states
Jan Robin Rohlicek
,
Alan S. Willsky
Journal of the ACM
35
(3), 1988, pp. 675-696
On the power of one-way communication
Jik H. Chang
,
Oscar H. Ibarra
,
Anastasios Vergis
Journal of the ACM
35
(3), 1988, pp. 697-726
Nonconstructive tools for proving polynomial-time decidability
Michael R. Fellows
,
Michael A. Langston
Journal of the ACM
35
(3), 1988, pp. 727-739
Fast algorithms for
n
-dimensional restrictions of hard problems
Friedhelm Meyer auf der Heide
Journal of the ACM
35
(3), 1988, pp. 740-747
A nonlinear lower bound for random-access machines under logarithmic cost
Arnold Schönhage
Journal of the ACM
35
(3), 1988, pp. 748-754
Many hard examples for resolution
Vas̑ek Chvátal
,
Endre Szemerédi
Journal of the ACM
35
(4), 1988, pp. 759-768
A new class of heuristic algorithms for weighted perfect matching
M.D. Grigoriadis
,
B. Kalantari
Journal of the ACM
35
(4), 1988, pp. 769-776
Optimal VLSI circuits for sorting
Richard Cole
,
Alan Siegel
Journal of the ACM
35
(4), 1988, pp. 777-809
A linear time algorithm for optimal routing around a rectangle
Teofilo F. Gonzalez
,
Sing-Ling Lee
Journal of the ACM
35
(4), 1988, pp. 810-831
Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
Shivendra S. Panwar
,
Don Towsley
,
Jack K. Wolf
Journal of the ACM
35
(4), 1988, pp. 832-844
Computing on an anonymous ring
Hagit Attiya
,
Marc Snir
,
Manfred K. Warmuth
Journal of the ACM
35
(4), 1988, pp. 845-875
Parallel hashing: An efficient implementation of shared memory
Anna R. Karlin
,
Eli Upfal
Journal of the ACM
35
(4), 1988, pp. 876-892
Eliminating go to's while preserving program structure
Lyle Ramshaw
Journal of the ACM
35
(4), 1988, pp. 893-920
A new approach to the maximum-flow problem
Andrew V. Goldberg
,
Robert E. Tarjan
Journal of the ACM
35
(4), 1988, pp. 921-940
Finite monoids and the fine structure of
NC^1
David A. Mix Barrington
,
Denis Thérien
Journal of the ACM
35
(4), 1988, pp. 941-952
Meager and replete failures of relative completeness
Daniel Leivant
,
Tim Fernando
Journal of the ACM
35
(4), 1988, pp. 953-964
Computational limitations on learning from examples
Leonard Pitt
,
Leslie G. Valiant
Journal of the ACM
35
(4), 1988, pp. 965-984
Counting is easy
Joel I. Seiferas
,
Paul M.B. Vitányi
Journal of the ACM
35
(4), 1988, pp. 985-1000
Seiten
<
1
2