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=39
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An optimal algorithm for intersecting line segments in the plane
Bernard Chazelle
,
Herbert Edelsbrunner
Journal of the ACM
39
(1), 1992, January, pp. 1-54
An
O(\log N)
deterministic packet-routing scheme
Eli Upfal
Journal of the ACM
39
(1), 1992, January, pp. 55-70
Syntactical characterization of a subset of domain-independent formulas
R. Demolombe
Journal of the ACM
39
(1), 1992, January, pp. 71-94
Institutions: Abstract model theory for specification and programming
J.A. Goguen
,
R.M. Burstall
Journal of the ACM
39
(1), 1992, January, pp. 95-146
Termination, deadlock, and divergence
L. Aceto
,
M. Hennessy
Journal of the ACM
39
(1), 1992, January, pp. 147-187
Single-class bounds of multi-class queuing networks
L.W. Dowdy
,
B.M. Carlson
,
A.T. Krantz
,
S.K. Tripathi
Journal of the ACM
39
(1), 1992, January, pp. 188-213
How to sign given any trapdoor permutation
M. Bellare
,
S. Micali
Journal of the ACM
39
(1), 1992, January, pp. 214-233
Lower bounds for the low hierarchy
E. Allender
,
L.A. Hemachandra
Journal of the ACM
39
(1), 1992, January, pp. 234-251
A general approach to connected-component labeling for arbitrary image representation
M.B. Dillencourt
,
H. Samet
,
M. Tamminen
Journal of the ACM
39
(2), 1992, April, pp. 253-280
An analysis of the longest match and the greedy heuristics in text encoding
J. Katajainen
,
T. Raita
Journal of the ACM
39
(2), 1992, April, pp. 281-294
Nonlinear pattern matching in trees
R. Ramesh
,
I.V. Ramakrishnan
Journal of the ACM
39
(2), 1992, April, pp. 295-316
The generation of binary trees as a numerical problem
R. Sprugnoli
Journal of the ACM
39
(2), 1992, April, pp. 317-327
What can machines know? On the properties of knowledge in distributed systems
R. Fagin
,
J.Y. Halpern
,
M.Y. Vardi
Journal of the ACM
39
(2), 1992, April, pp. 328-376
Theorem proving using equational matings and rigid
E
-unification
J. Gallier
,
P. Narendran
,
S. Raatz
,
W. Snyder
Journal of the ACM
39
(2), 1992, April, pp. 377-429
A four russians algorithm for regular expression pattern matching
G. Myers
Journal of the ACM
39
(2), 1992, April, pp. 430-448
A little knowledge goes a long way: Knowledge-based derivations and correctness proofs for a family of protocols
J.Y. Halpern
,
L.D. Zuck
Journal of the ACM
39
(3), 1992, July, pp. 449-478
The pagenumber of genus
g
graphs is
O(g)
L.S. Heath
,
S. Istrail
Journal of the ACM
39
(3), 1992, July, pp. 479-501
An efficient algorithm for a task allocation problem
A. Billionnet
,
M.C. Costa
,
A. Sutter
Journal of the ACM
39
(3), 1992, July, pp. 502-518
Sparse dynamic programming I: Linear cost functions
D. Eppstein
,
Z. Galil
,
R. Giancarlo
,
G.F. Italiano
Journal of the ACM
39
(3), 1992, July, pp. 519-545
Sparse dynamic programming II: Convex and concave cost functions
D. Eppstein
,
Z. Galil
,
R. Giancarlo
,
G.F. Italiano
Journal of the ACM
39
(3), 1992, July, pp. 546-567
The membership problem in aperiodic transformation monoids
M. Beaudry
,
P. McKenzie
,
D. Thérien
Journal of the ACM
39
(3), 1992, July, pp. 599-616
On pointers versus addresses
A. Ben-Amram
,
Z. Galil
Journal of the ACM
39
(3), 1992, July, pp. 617-648
Learning via queries
W.I. Gasarch
,
C.H. Smith
Journal of the ACM
39
(3), 1992, July, pp. 649-674
Reasoning about systems with many processes
S.M. German
,
A.P. Sistla
Journal of the ACM
39
(3), 1992, July, pp. 675-735
Monotone circuits for matching require linear depth
R. Raz
,
A. Wigderson
Journal of the ACM
39
(3), 1992, July, pp. 736-744
Seiten 1
2
>