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. Comput.~Syst.~Sci. AND Volume=57
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The relative complexity of
NP
search problems
Paul Beame
,
Stephen Cook
,
Jeff Edmonds
,
Russell Impagliazzo
,
Toniann Pitassi
Journal of Computer and System Sciences
57
(1), 1998, pp. 3-19
What do we know about the metropolis algorithm?
P. Diaconis
,
L. Saloff-Coste
Journal of Computer and System Sciences
57
(1), 1998, pp. 20-36
On data structures and asymmetric communication complexity
Peter Bro Miltersen
,
Noam Nisan
,
Shmuel Safra
,
Avi Wigderson
Journal of Computer and System Sciences
57
(1), 1998, pp. 37-49
Randomized query processing in robot path planning
Lydia E. Kavraki
,
Jean-Claude Latombe
,
Rajeev Motwani
,
Prabhakar Raghavan
Journal of Computer and System Sciences
57
(1), 1998, pp. 50-60
Approximations for the disjoint paths problem in high-diameter planar networks
Jon Kleinberg
,
Éva Tardos
Journal of Computer and System Sciences
57
(1), 1998, pp. 61-73
Sorting in linear time?
Arne Andersson
,
Torben Hagerup
,
Stefan Nilsson
,
Rajeev Raman
Journal of Computer and System Sciences
57
(1), 1998, pp. 74-93
What's decidable about hybrid automata?
Thomas A. Henzinger
,
Peter W. Kopke
,
Anuj Puri
,
Pravin Varaiya
Journal of Computer and System Sciences
57
(1), 1998, pp. 94-124
Reductions in circuit complexity: An isomorphism theorem and a gap theorem
Manindra Agrawal
,
Eric Allender
,
Steven Rudich
Journal of Computer and System Sciences
57
(2), 1998, pp. 127-143
Integer programming as a framework for optimization and approximability
Ian Barland
,
Phokion G. Kolaitis
,
Madhukar N. Thakur
Journal of Computer and System Sciences
57
(2), 1998, pp. 144-161
Good degree bounds on Nullstellensatz refutations of the induction principle
Samuel R. Buss
,
Toniann Pitassi
Journal of Computer and System Sciences
57
(2), 1998, pp. 162-171
DNA models and algorithms for
NP
-complete problems
Eric Bach
,
Anne Condon
,
Elton Glaser
,
Celena Tanguay
Journal of Computer and System Sciences
57
(2), 1998, pp. 172-186
Zero knowledge and the chromatic number
Uriel Feige
,
Joe Kilian
Journal of Computer and System Sciences
57
(2), 1998, pp. 187-199
Nondeterministic
NC^1
computation
Hervé Caussinus
,
Pierre McKenzie
,
Denis Thérien
,
Heribert Vollmer
Journal of Computer and System Sciences
57
(2), 1998, pp. 200-212
Deterministic and randomized bounded truth-table reductions of
P
,
NL
, and
L
to sparse sets
Dieter van Melkebeek
Journal of Computer and System Sciences
57
(2), 1998, pp. 213-232
Sequences, Datalog, and transducers
Anthony Bonner
,
Giansalvatore Mecca
Journal of Computer and System Sciences
57
(3), 1998, pp. 234-259
Safe locking policies for dynamic databases
Vinay K. Chaudhri
,
Vassos Hadzilacos
Journal of Computer and System Sciences
57
(3), 1998, pp. 260-271
Algebras for querying text regions: Expressive power and optimization
Mariano P. Consens
,
Tova Milo
Journal of Computer and System Sciences
57
(3), 1998, pp. 272-288
Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
Guozhu Dong
,
Jianwen Su
Journal of Computer and System Sciences
57
(3), 1998, pp. 289-308
Increasing the resilience of distributed and replicated database systems
Idit Keidar
,
Danny Dolev
Journal of Computer and System Sciences
57
(3), 1998, pp. 309-324
Semantics and expressiveness issues in active databases
Philippe Picouet
,
Victor Vianu
Journal of Computer and System Sciences
57
(3), 1998, pp. 325-355
Learning with refutation
Sanjay Jain
Journal of Computer and System Sciences
57
(3), 1998, pp. 356-365
Characterizing multiterminal flow networks and computing flows in networks of small treewidth
Torben Hagerup
,
Jyrki Katajainen
,
Naomi Nishimura
,
Prabhakar Ragde
Journal of Computer and System Sciences
57
(3), 1998, pp. 366-375
Approximating hyper-rectangles: Learning and pseudorandom sets
Peter Auer
,
Philip M. Long
,
Aravind Srinivasan
Journal of Computer and System Sciences
57
(3), 1998, pp. 376-388
Achilles and the tortoise climbing up the arithmetical hierarachy
Eugene Asarin
,
Oded Maler
Journal of Computer and System Sciences
57
(3), 1998, pp. 389-398
A three-party communication problem
Leonard J. Schulman
Journal of Computer and System Sciences
57
(3), 1998, pp. 399-401