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=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Relational expressive power of constraint query languages
Michael Benedikt
,
Guozhu Dong
,
Leonid Libkin
,
Limsoon Wong
Journal of the ACM
45
(1), 1998, pp. 1-34
Implementing sequentially consistent shared objects using broadcast and point-to-point communication
Alan Fekete
,
M. Frans Kaashoek
,
Nancy Lynch
Journal of the ACM
45
(1), 1998, pp. 35-69
Probabilistic checking of proofs: A new characterization of
NP
Sanjeev Arora
,
Shmuel Safra
Journal of the ACM
45
(1), 1998, pp. 70-122
Explicit
OR
-dispersers with polylogarithmic degree
Michael Saks
,
Aravind Srinivasan
,
Shiyu Zhou
Journal of the ACM
45
(1), 1998, pp. 123-154
Theory of neuromata
Jiȓí S̑íma
,
Jiȓí Wiedermann
Journal of the ACM
45
(1), 1998, pp. 155-178
A new general derandomization method
Alexander E. Andreev
,
Andrea E.F. Clementi
,
José D.P. Rolim
Journal of the ACM
45
(1), 1998, pp. 179-213
Erratum to ''Reasoning about knowledge and probability''
Ronald Fagin
,
Joseph Y. Halpern
Journal of the ACM
45
(1), 1998, pp. 214-214
How to learn an unknown environment I: The rectilinear case
Xiaotie Deng
,
Tiko Kameda
,
Christos Papadimitriou
Journal of the ACM
45
(2), 1998, pp. 215-245
Approximate graph coloring by semidefinite programming
David Karger
,
Rajeev Motwani
,
Madhu Sudan
Journal of the ACM
45
(2), 1998, pp. 246-265
Computing homology groups of simplicial complexes in
R^3
Tamal K. Dey
,
Sumanta Guha
Journal of the ACM
45
(2), 1998, pp. 266-287
Randomized binary search trees
Conrado Martínez
,
Salvador Roura
Journal of the ACM
45
(2), 1998, pp. 288-323
On contention resolution protocols and associated probabilistic phenomena
P.D. MacKenzie
,
C.G. Plaxton
,
R. Rajaraman
Journal of the ACM
45
(2), 1998, pp. 324-378
Efficient descriptor-vector multiplications in stochastic automata networks
Paulo Fernandes
,
Brigitte Plateau
,
William J. Stewart
Journal of the ACM
45
(3), 1998, pp. 381-414
Lower bounds for distributed coin-flipping and randomized consensus
James Aspnes
Journal of the ACM
45
(3), 1998, pp. 415-450
Fault-tolerant wait-free shared objects
Prasad Jayanti
,
Tushar Deepak Chandra
,
Sam Toueg
Journal of the ACM
45
(3), 1998, pp. 451-500
Proof verification and the hardness of approximation problems
Sanjeev Arora
,
Carsten Lund
,
Rajeev Motwani
,
Madhu Sudan
,
Mario Szegedy
Journal of the ACM
45
(3), 1998, pp. 501-555
Formal verification of complex coherence protocols using symbolic state models
Fong Pong
,
Michel Dubois
Journal of the ACM
45
(4), 1998, pp. 557-587
On the decidability and axiomatization of query finiteness in deductive databases
Michael Kifer
Journal of the ACM
45
(4), 1998, pp. 588-633
A threshold of
ln n
for approximating set cover
Uriel Feige
Journal of the ACM
45
(4), 1998, pp. 634-652
Property testing and its connection to learning and approximation
Oded Goldreich
,
Shari Goldwasser
,
Dana Ron
Journal of the ACM
45
(4), 1998, pp. 653-750
Polynomial time approximation schemes for Euclidean Traveling Salesman and other geometric problems
Sanjeev Arora
Journal of the ACM
45
(5), 1998, pp. 753-782
Beyond the flow decomposition barrier
Andrew V. Goldberg
,
Satish Rao
Journal of the ACM
45
(5), 1998, pp. 783-797
Object identity as a query language primitive
Serge Abiteboul
,
Paris C. Kanellakis
Journal of the ACM
45
(5), 1998, pp. 798-842
On the space complexity of randomized synchronization
Faith Fich
,
Maurice Herlihy
,
Nir Shavit
Journal of the ACM
45
(5), 1998, pp. 843-862
Noise-tolerant distribution-free learning of general geometric concepts
Nader H. Bshouty
,
Sally A. Goldman
,
H. David Mathias
,
Subhash Suri
,
Hisao Tamaki
Journal of the ACM
45
(5), 1998, pp. 863-890
Seiten 1
2
>