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=48
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dynamic planar convex hull operations in near-logarithmic amortized time
Timothy M. Chan
Journal of the ACM
48
(1), 2001, pp. 1-12
Adversarial queuing theory
Allan Borodin
,
Jon Kleinberg
,
Prabhakar Raghavan
,
Madhu Sudan
,
David P. Williamson
Journal of the ACM
48
(1), 2001, pp. 13-38
Universal-stability results and performance bounds for greedy contention-resolution protocols
Matthew Andrews
,
Baruch Awerbuch
,
Antonio Fernández
,
Tom Leighton
,
Zhiyong Liu
,
Jon Kleinberg
Journal of the ACM
48
(1), 2001, pp. 39-69
Automated complexity analysis based on ordered resolution
David Basin
,
Harald Ganzinger
Journal of the ACM
48
(1), 2001, pp. 70-109
Lattice computers for approximating Euclidean space
John Case
,
Dayanand S. Rajan
,
Anil M. Shende
Journal of the ACM
48
(1), 2001, pp. 110-144
Erratum: A counterexample to W. Bibel's and E. Eder's strong completeness result for connection graph resolution
Jörg H. Siekmann
,
Graham Wrightson
Journal of the ACM
48
(1), 2001, pp. 145-147
Short proofs are narrow - Resolution made simple
Eli Ben-Sasson
,
Avi Wigderson
Journal of the ACM
48
(2), 2001, pp. 149-169
Improved master theorems for divide-and-conquer recurrences
Salvador Roura
Journal of the ACM
48
(2), 2001, pp. 170-205
Convex quadratic and semidefinite programming relaxations in scheduling
Martin Skutella
Journal of the ACM
48
(2), 2001, pp. 206-242
Approximation algorithms for metric facility location and
k
-median problems using the primal-dual schema and Lagrangian relaxation
Kamal Jain
,
Vijay V. Vazirani
Journal of the ACM
48
(2), 2001, pp. 274-296
Concurrent threads and optimal parallel minimum spanning trees algorithm
Ka Wong Chong
,
Yijie Han
,
Tak Wah Lam
Journal of the ACM
48
(2), 2001, pp. 297-323
A general approach to dynamic packet routing with bounded buffers
Andrei Z. Broder
,
Alan M. Frieze
,
Eli Upfal
Journal of the ACM
48
(2), 2001, pp. 324-349
Unconditional security in quantum cryptography
Dominic Mayers
Journal of the ACM
48
(3), 2001, pp. 351-406
An analysis of the Burrows-Wheeler transform
Giovanni Manzini
Journal of the ACM
48
(3), 2001, pp. 407-430
The complexity of acyclic conjunctive queries
Georg Gottlob
,
Nicola Leone
,
Francesco Scarcello
Journal of the ACM
48
(3), 2001, pp. 431-498
Simplifying fault-tolerance: Providing the abstraction of crash failures
Rida A. Bazzi
,
Gil Neiger
Journal of the ACM
48
(3), 2001, pp. 499-554
A modal analysis of staged computation
Rowan Davies
,
Frank Pfenning
Journal of the ACM
48
(3), 2001, pp. 555-604
Decomposable negation normal form
Adnan Darwiche
Journal of the ACM
48
(4), 2001, pp. 608-647
Plausibility measures and default reasoning
Nir Friedman
,
Joseph Y. Halpern
Journal of the ACM
48
(4), 2001, pp. 648-685
An efficient algorithm for image segmentation, Markov random fields and related problems
Dorit S. Hochbaum
Journal of the ACM
48
(4), 2001, pp. 686-701
Efficient generation of shared RSA keys
Dan Boneh
,
Matthew Franklin
Journal of the ACM
48
(4), 2001, pp. 702-722
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
Jacob Holm
,
Kristian de Lichtenberg
,
Mikkel Thorup
Journal of the ACM
48
(4), 2001, pp. 723-760
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Satoru Iwata
,
Lisa Fleischer
,
Satoru Fujishige
Journal of the ACM
48
(4), 2001, pp. 761-777
Quantum lower bounds by polynomials
Robert Beals
,
Harry Buhrman
,
Richard Cleve
,
Michele Mosca
,
Ronald de Wolf
Journal of the ACM
48
(4), 2001, pp. 778-797
Some optimal inapproximability results
Johan Håstad
Journal of the ACM
48
(4), 2001, pp. 798-859
Seiten 1
2
>