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=SIAM J. Comput. AND Volume=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multiple noninteractive zero knowledge proofs under general assumptions
Uriel Feige
,
Dror Lapidot
,
Adi Shamir
SIAM Journal on Computing
29
(1), 1999, pp. 1-28
Tight analyses of two local load balancing algorithms
Bhaskar Ghosh
,
F.T. Leighton
,
Bruce M. Maggs
,
S. Muthukrishnan
,
C. Greg Plaxton
,
R. Rajaraman
,
Andréa W. Richa
,
Robert E. Tarjan
,
David Zuckerman
SIAM Journal on Computing
29
(1), 1999, pp. 29-64
An algorithm for shortest paths in bipartite digraphs with concave weight matrices and its applications
Xin He
,
Zhi-Zhong Chen
SIAM Journal on Computing
29
(1), 1999, pp. 65-80
Regular closure of deterministic languages
Eberhard Bertsch
,
Mark-Jan Nederhof
SIAM Journal on Computing
29
(1), 1999, pp. 81-102
Constructing evolutionary trees in the presence of polymorphic characters
Maria Bonet
,
Cynthia Phillips
,
Tandy Warnow
,
Shibu Yooseph
SIAM Journal on Computing
29
(1), 1999, pp. 103-131
The complexity of tree automata and logics of programs
E. Allen Emerson
,
Charanjit S. Jutla
SIAM Journal on Computing
29
(1), 1999, pp. 132-158
Finding separator cuts in planar graphs within twice the optimal
Naveen Garg
,
Huzur Saran
,
Vijay V. Vazirani
SIAM Journal on Computing
29
(1), 1999, pp. 159-179
Balanced allocations
Yossi Azar
,
Andrei Z. Broder
,
Anna R. Karlin
,
Eli Upfal
SIAM Journal on Computing
29
(1), 1999, pp. 180-200
The algorithmic aspects of uncrowded hypergraphs
Claudia Bertram-Kretzberg
,
Hanno Lefmann
SIAM Journal on Computing
29
(1), 1999, pp. 201-230
Achilles, Turtle, and undecidable boundedness problems for small DATALOG programs
Jerzy Marcinkowski
SIAM Journal on Computing
29
(1), 1999, pp. 231-257
Tight bounds on the size of fault-tolerant merging and sorting networks with destructive faults
Tom Leighton
,
Yuan Ma
SIAM Journal on Computing
29
(1), 1999, pp. 258-273
Routing with minimum wire length in the dogleg-free Manhattan model is
NP
-complete
Tibor Szkaliczki
SIAM Journal on Computing
29
(1), 1999, pp. 274-287
On regular tree embeddings
Weimin Chen
,
Volker Turau
SIAM Journal on Computing
29
(1), 1999, pp. 288-301
Equivalence of measures of complexity classes
Josef M. Breutzmann
,
Jack H. Lutz
SIAM Journal on Computing
29
(1), 1999, pp. 302-326
The swapping problem on a line
Shoshana Anily
,
Michel Gendreau
,
Gilbert Laporte
SIAM Journal on Computing
29
(1), 1999, pp. 327-335
How good is the Goemans-Williamson MACX CUT algorithm?
Howard Karloff
SIAM Journal on Computing
29
(1), 1999, pp. 336-350
Solvability in asynchronous environments II: Finite interactive tasks
Benny Chor
,
Lee-Bath Nelson
SIAM Journal on Computing
29
(2), 1999, pp. 351-377
Weakly triangulated comparability graphs
Elaine Eschen
,
Ryan B. Hayward
,
Jeremy Spinrad
,
R. Sritharan
SIAM Journal on Computing
29
(2), 1999, pp. 378-386
On approximately counting colorings of small degree graphs
Russ Bubley
,
Martin Dyer
,
Catherine Greenhill
,
Mark Jerrum
SIAM Journal on Computing
29
(2), 1999, pp. 387-400
Ranking primitive recursions: The low Grzegorczyk classes revisited
Stephen J. Bellantoni
,
Karl-Heinz Niggl
SIAM Journal on Computing
29
(2), 1999, pp. 401-415
Communication-efficient parallel sorting
Michael T. Goodrich
SIAM Journal on Computing
29
(2), 1999, pp. 416-432
Proximity in arrangements of algebraic sets
J.H. Rieger
SIAM Journal on Computing
29
(2), 1999, pp. 433-458
Better bounds for online scheduling
Susanne Albers
SIAM Journal on Computing
29
(2), 1999, pp. 459-473
Tight bounds for on-line tree embeddings
Sandeep Bhatt
,
David Greenberg
,
Tom Leighton
,
Pangfeng Liu
SIAM Journal on Computing
29
(2), 1999, pp. 474-491
A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem
David R. Karger
SIAM Journal on Computing
29
(2), 1999, pp. 492-514
Seiten 1
2
3
4
>