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 Volume=35
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Addendum to ``Initializing generalized feedback shift register pseudorandom number generators''
Bruce Jay Collings
,
G. Barry Hembree
Journal of the ACM
35
(4), 1988, pp. 1001
Many-sorted unification
Christoph Walther
Journal of the ACM
35
(1), 1988, pp. 1-17
The complexity of searching a graph
N. Megiddo
,
S.L. Hakimi
,
M.R. Garey
,
D.S. Johnson
,
C.H. Papadimitriou
Journal of the ACM
35
(1), 1988, pp. 18-44
Optimal design and use of retry in fault-tolerant computer systems
Yann-Hang Lee
,
Kang G. Shin
Journal of the ACM
35
(1), 1988, pp. 45-69
Equivalence and optimization of relational transactions
Serge Abiteboul
,
Victor Vianu
Journal of the ACM
35
(1), 1988, pp. 70-120
A theory of reliability in database systems
Vassos Hadzilacos
Journal of the ACM
35
(1), 1988, pp. 121-145
On conjunctive queries containing inequalities
Anthony Klug
Journal of the ACM
35
(1), 1988, pp. 146-160
External hashing with limited internal storage
Gaston H. Gonnet
,
Per-Åke Larson
Journal of the ACM
35
(1), 1988, pp. 161-184
Automating program analysis
Timothy Hickey
,
Jacques Cohen
Journal of the ACM
35
(1), 1988, pp. 185-220
A vertex-allocation theorem for resources in queuing networks
Satish K. Tripathi
,
C. Murray Woodside
Journal of the ACM
35
(1), 1988, pp. 221-230
Greatest common divisors of polynomials given by straight-line programs
Erich Kaltofen
Journal of the ACM
35
(1), 1988, pp. 231-264
On the shortest paths between two convex polyhedra
Avikam Baltsan
,
Micha Sharir
Journal of the ACM
35
(2), 1988, pp. 267-287
Consensus in the presence of partial synchrony
Cynthia Dwork
,
Nancy Lynch
,
Larry Stockmeyer
Journal of the ACM
35
(2), 1988, pp. 288-323
Church-Rosser Thue systems and formal languages
Robert McNaughton
,
Paliath Narendran
,
Friedrich Otto
Journal of the ACM
35
(2), 1988, pp. 324-344
Efficient tests for top-down termination of logical rules
Jeffrey D. Ullman
,
Allen van Gelder
Journal of the ACM
35
(2), 1988, pp. 345-373
An
O(n^2(m+n\log n)\log n)
min-cost flow algorithm
Zvi Galil
,
éva Tardos
Journal of the ACM
35
(2), 1988, pp. 374-386
The time complexity of maximum matching by simulated annealing
Galen H. Sasaki
,
Bruce Hajek
Journal of the ACM
35
(2), 1988, pp. 387-403
The schematic protection model: Its definition and analysis for acyclic attenuating schemes
Ravinderpal Singh Sandhu
Journal of the ACM
35
(2), 1988, pp. 404-432
Optimal directory placement on disk storage devices
A.R. Calderbank
,
E.G., Jr. Coffman
,
Leopold Flatto
Journal of the ACM
35
(2), 1988, pp. 433-446
Comparing the combinational complexities of arithmetic functions
Helmut Alt
Journal of the ACM
35
(2), 1988, pp. 447-460
On the complexity of branching programs and decision trees for clique functions
Ingo Wegener
Journal of the ACM
35
(2), 1988, pp. 461-471
A mechanical proof of the Church-Rosser theorem
N. Shanker
Journal of the ACM
35
(3), 1988, pp. 475-522
Finding a maximum-genus graph embedding
Merrick L. Furst
,
Jonathan L. Gross
,
Lyle A. McGeoch
Journal of the ACM
35
(3), 1988, pp. 523-534
The coloring and maximum independent set problems on planar perfect graphs
Wen-Lian Hsu
Journal of the ACM
35
(3), 1988, pp. 535-563
Some distributions that allow perfect packing
Wansoo T. Rhee
,
Michel Talagrand
Journal of the ACM
35
(3), 1988, pp. 564-578
Seiten 1
2
>