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=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The harmonic
k
-server algorithm is competitive
Yair Bartal
,
Eddie Grove
Journal of the ACM
47
(1), 2000, pp. 1-15
Parallel RAMs with owned global memory and deterministic context-free language recognition
Patrick W. Dymond
,
Walter L. Ruzzo
Journal of the ACM
47
(1), 2000, pp. 16-45
Minimum cuts in near-linear time
David R. Karger
Journal of the ACM
47
(1), 2000, pp. 46-76
Existential second-order logic over strings
Thomas Eiter
,
Georg Gottlob
,
Yuri Gurevich
Journal of the ACM
47
(1), 2000, pp. 77-131
Polylog-time and near-linear work approximation scheme for undirected shortest paths
Edith Cohen
Journal of the ACM
47
(1), 2000, pp. 132-166
From Algol to polymorphic linear lambda-calculus
Peter W. O'Hearn
,
John C. Reynolds
Journal of the ACM
47
(1), 2000, pp. 167-223
Eavesdropping games: A graph-theoretic approach to privacy in distributed systems
Matthew Franklin
,
Zvi Galil
,
Moti Yung
Journal of the ACM
47
(2), 2000, pp. 225-243
The fault span of crash failures
George Varghese
,
Mahesh Jayaram
Journal of the ACM
47
(2), 2000, pp. 244-293
An
O(\log(n)^{4/3})
space algorithm for
(s, t)
connectivity in undirected graphs
Roy Armoni
,
Amnon Ta-Shma
,
Avi Widgerson
,
Shiyu Zhou
Journal of the ACM
47
(2), 2000, pp. 294-311
An automata-theoretic approach to branching-time model checking
Orna Kupferman
,
Moshe Y. Vardi
,
Pierre Wolper
Journal of the ACM
47
(2), 2000, pp. 312-360
Making abstract interpretations complete
Roberto Giacobazzi
,
Francesco Ranzato
,
Francesca Scozzari
Journal of the ACM
47
(2), 2000, pp. 361-416
A subdivision-based algorithm for the sparse resultant
John F. Canny
,
Ioannis Z. Emiris
Journal of the ACM
47
(3), 2000, pp. 417-451
An axiomatic treatment of three qualitative decision criteria
Ronen I. Brafman
,
Moshe Tennenholtz
Journal of the ACM
47
(3), 2000, pp. 452-482
The expressibility of languages and relations by word equations
Juhani Karhumäki
,
Filippo Mignosi
,
Wojciech Plandowski
Journal of the ACM
47
(3), 2000, pp. 483-505
Learning functions represented as multiplicity automata
Amos Beimel
,
Francesco Bergadano
,
Nader H. Bshouty
,
Eyal Kushilevitz
,
Stefano Varricchio
Journal of the ACM
47
(3), 2000, pp. 506-530
Behavioral equivalence in the polymorphic pi-calculus
Benjamin C. Pierce
,
Davide Sangiorgi
Journal of the ACM
47
(3), 2000, pp. 531-584
Divide-and-cconquer approximation algorithms via spreading metrics
Guy Even
,
Joseph (Seffi) Naor
,
Satish Rao
,
Baruch Schieber
Journal of the ACM
47
(4), 2000, pp. 585-616
Speed is as powerful as clairvoyance
Bala Kalyanasundaram
,
Kirk Pruhs
Journal of the ACM
47
(4), 2000, pp. 617-643
Relational queries over interpreted structures
Michael Benedikt
,
Leonid Libkin
Journal of the ACM
47
(4), 2000, pp. 644-680
Complexity of finite-horizon Markov decision process problems
Martin Mundhenk
,
Judy Goldsmith
,
Christopher Lusena
,
Eric Allender
Journal of the ACM
47
(4), 2000, pp. 681-720
Orthologic and quantum logic: Models and computational elements
J.P. Rawling
,
S.A. Selesnick
Journal of the ACM
47
(4), 2000, pp. 721-751
Balanced sequences and optimal routing
Eitan Altman
,
Bruno Gaujal
,
Arie Hordijk
Journal of the ACM
47
(4), 2000, pp. 752-775
A needed narrowing strategy
Sergio Antoy
,
Rachid Echahed
,
Michael Hanus
Journal of the ACM
47
(4), 2000, pp. 776-822
Building tractable disjunctive constraints
David Cohen
,
Peter Jeavons
,
Peter Jonsson
,
Manolis Koubarakis??
Journal of the ACM
47
(5), 2000, pp. 826-853
A neuroidal architecture for cognitive computation
Leslie G. Valiant
Journal of the ACM
47
(5), 2000, pp. 854-882
Seiten 1
2
>