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=40
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algorithm for finding canonical sets of ground rewrite rules in polynomial time
J. Gallier
,
P. Narendran
,
D. Plaisted
,
S. Raatz
,
W. Snyder
Journal of the ACM
40
(1), 1993, January, pp. 1-16
Perfectly secure message transmission
D. Dolev
,
C. Dwork
,
O. Waarts
,
M. Yung
Journal of the ACM
40
(1), 1993, January, pp. 17-47
Generating automatically tuned bitmaps from outlines
J.D. Hobby
Journal of the ACM
40
(1), 1993, January, pp. 48-94
The minimum consistent DFA problem cannot be approximated within any polynomial
L. Pitt
,
M.K. Warmuth
Journal of the ACM
40
(1), 1993, January, pp. 95-142
A framework for defining logics
R. Harper
,
F. Honsell
,
G. Plotkin
Journal of the ACM
40
(1), 1993, January, pp. 143-184
Learning read-once formulas with queries
D. Angluin
,
L. Hellerstein
,
M. Karpinski
Journal of the ACM
40
(1), 1993, January, pp. 185-210
On the complexity of functions for random access machines
Nader H. Bshouty
Journal of the ACM
40
(2), 1993, April, pp. 211-223
Recontamination does not help to search a graph
Andrea S. LaPaugh
Journal of the ACM
40
(2), 1993, April, pp. 224-245
Taxonomic syntax for first order inference
David McAllester
,
Robert Givan
Journal of the ACM
40
(2), 1993, April, pp. 246-283
Automatic recognition of tractability in inference relations
David A. McAllester
Journal of the ACM
40
(2), 1993, April, pp. 284-303
The cost of conservative synchronization in parallel discrete event simulations
David M. Nicol
Journal of the ACM
40
(2), 1993, April, pp. 304-333
Simulating synchronized clocks and common knowledge in distributed systems
Gil Neiger
,
Sam Toueg
Journal of the ACM
40
(2), 1993, April, pp. 334-367
Efficient decision procedures for graph properties on context-free graph languages
Thomas Lengauer
,
Egon Wanke
Journal of the ACM
40
(2), 1993, April, pp. 368-393
An execution/sleep scheduling policy for serving an additional job in priority queuing systems
Kin K. Leung
Journal of the ACM
40
(2), 1993, April, pp. 394-417
Random walks on weighted graphs and applications to on-line algorithms
Don Coppersmith
,
Peter Doyle
,
Prabhakar Raghavan
,
Marc Snir
Journal of the ACM
40
(3), 1993, July, pp. 421-453
Randomized algorithms and pseudorandom numbers
Howard J. Karloff
,
Prabhakar Raghavan
Journal of the ACM
40
(3), 1993, July, pp. 454-476
Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
Franz Baader
Journal of the ACM
40
(3), 1993, July, pp. 477-503
Dissolution: Making paths vanish
Neil V. Murray
,
Erik Rosenthal
Journal of the ACM
40
(3), 1993, July, pp. 504-535
Factorization and circuit in the connection method
C.A. Johnson
Journal of the ACM
40
(3), 1993, July, pp. 536-557
Z-module reasoning: An equality-oriented proving method with built-in ring axioms
Tie-Cheng Wang
Journal of the ACM
40
(3), 1993, July, pp. 558-606
Constant depth circuits, Fourier transform, and learnability
Nathan Linial
,
Yishay Mansour
,
Noam Nisan
Journal of the ACM
40
(3), 1993, July, pp. 607-620
Dynamic interpolation search
Kurt Mehlhorn
,
Athanasios Tsakalidis
Journal of the ACM
40
(3), 1993, July, pp. 621-634
Union-copy structures and dynamic segment trees
Marc J. van Kreveld
,
Mark H. Overmars
Journal of the ACM
40
(3), 1993, July, pp. 635-652
Decidability of bisimulation equivalence for processes generating context-free languages
J.C.M. Baeten
,
J.A. Bergstra
,
J.W. Klop
Journal of the ACM
40
(3), 1993, July, pp. 653-682
Undecidable optimization problems for database logic programs
Haim Gaifman
,
Harry Mairson
,
Yehoshua Sagiv
,
Moshe Y. Vardi
Journal of the ACM
40
(3), 1993, July, pp. 683-713
Seiten 1
2
>