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
[1]
Hilfe
Suche: Journal=J. ACM AND Volume=50
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Classical physics and the church - Turing thesis
Andrew Chi-Chih Yao
Journal of the ACM
50
(1), 2003, pp. 100-105
Mini-buckets: A general scheme for bounded inference
Rina Dechter
,
Irina Rish
Journal of the ACM
50
(2), 2003, pp. 107-153
Time-space trade-off lower bounds for randomized computation of decision problems
Paul Beame
,
Michael Saks
,
Xiaodong Sun
,
Erik Vee
Journal of the ACM
50
(2), 2003, pp. 154-195
A complete problem for statistical zero knowledge
Amit Sahai
,
Salil Vadhan
Journal of the ACM
50
(2), 2003, pp. 196-249
A foundation for designing deadlock-free routing algorithms in wormhole networks
D.N. Jayasimha
,
Loren Schwiebert
,
D. Manivannan
,
Jeff A. May
Journal of the ACM
50
(2), 2003, pp. 250-275
Erratum to ''Constraint tightness and looseness versus local and global consistency''
Yuanlin Zhang
,
Roland H.C. Yap
Journal of the ACM
50
(3), 2003, pp. 277-279
A differential approach to inference in Bayesian networks
Adnan Darwiche
Journal of the ACM
50
(3), 2003, pp. 280-305
The height of a random binary search tree
Bruce Reed
Journal of the ACM
50
(3), 2003, pp. 306-332
An analytic approach to the height of binary search trees II
Michael Drmota
Journal of the ACM
50
(3), 2003, pp. 333-374
Algorithms for computing the static single assignment form
Gianfranco Bilardi
,
Keshav Pingali
Journal of the ACM
50
(3), 2003, pp. 375-425
Primality and identity testing via Chinese remaindering
Manindra Agrawal
,
Somenath Biswas
Journal of the ACM
50
(4), 2003, pp. 429-443
Algorithms adapting to point contention
Hagit Attiya
,
Arie Fouren
Journal of the ACM
50
(4), 2003, pp. 444-468
Computability theory of generalized functions
Ning Zhong
,
Klaus Weihrauch
Journal of the ACM
50
(4), 2003, pp. 469-505
Noise-tolerant learning, the parity problem, and the statistical query model
Avrim Blum
,
Adam Kalai
,
Hal Wasserman
Journal of the ACM
50
(4), 2003, pp. 506-519
Bounds on delays and queue lengths in input-queued cell switches
Emilio Leonardi
,
Marco Mellia
,
Fabio Neri
,
Marco Ajmone Marsan
Journal of the ACM
50
(4), 2003, pp. 520-550
Minimizing flow time nonclairvoyantly
Bala Kalyanasundaram
,
Kirk R. Pruhs
Journal of the ACM
50
(4), 2003, pp. 551-567
How asymmetry helps load balancing
Berthold Vöcking
Journal of the ACM
50
(4), 2003, pp. 568-589
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Andrei Krokhin
,
Peter Jeavons
,
Peter Jonsson
Journal of the ACM
50
(5), 2003, pp. 591-640
The geometric maximum Traveling Salesman Problem
Alexander Barvinok
,
Sándor P. Fekete
,
David S. Johnson
,
Arie Tamir
,
Gerhard J. Woeginger
,
Russ Woodroofe
Journal of the ACM
50
(5), 2003, pp. 641-664
The performance of difference coding for sets and relational tables
Wei Biao Wu
,
Chinya V. Ravishankar
Journal of the ACM
50
(5), 2003, pp. 665-693
Definable relations and first-order query languages over strings
Michael Benedikt
,
Leonid Libkin
,
Thomas Schwentick
,
Luc Segoufin
Journal of the ACM
50
(5), 2003, pp. 694-751
Counterexample-guided abstraction refinement for symbolic model checking
Edmund Clarke
,
Orna Grumberg
,
Somesh Jha
,
Yuan Lu
,
Helmut Veith
Journal of the ACM
50
(5), 2003, pp. 752-794
Greedy facility location algorithms analyzed using dual fitting with factor-revealing
LP
Kamal Jain
,
Mohammad Mahdian
,
Evangelos Markakis
,
Amin Saberi
,
Vijay V. Vazirani
Journal of the ACM
50
(6), 2003, pp. 795-824
Improving table compression with combinatorial optimization
Adam L. Buchsbaum
,
Glenn S. Fowler
,
Raffaele Giancarlo
Journal of the ACM
50
(6), 2003, pp. 825-851
Magic functions (In memoriam: Bernard M. Dwork 1923-1998)
Cynthia Dwork
,
Moni Naor
,
Omer Reingold
,
Larry Stockmeyer
Journal of the ACM
50
(6), 2003, pp. 852-921
Seiten
<
1
2
3
>