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=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The density of weakly complete problems under adaptive reductions
Jack H. Lutz
,
Yong Zhao
SIAM Journal on Computing
30
(4), 2000, pp. 1197-1210
A finite state version of the Kraft-Mcmillan theorem
Frédérique Bassino
,
Marie-Pierre Béal
,
Dominique Perrin
SIAM Journal on Computing
30
(4), 2000, pp. 1211-1230
An 8-approximation algorithm for the subset feedback vertex set problem
Guy Even
,
Joseph (Seffi) Naor
,
Leonid Zosin
SIAM Journal on Computing
30
(4), 2000, pp. 1231-1252
Computationally sound proofs
Silvio Micali
SIAM Journal on Computing
30
(4), 2000, pp. 1253-1298
The complexity of modular graph automorphism
V. Arvind
,
R. Beigel
,
A. Lozano
SIAM Journal on Computing
30
(4), 2000, pp. 1299-1320
Approximating shortest paths on a nonconvex polyhedron
Kasturi R. Varadarajan
,
Pankaj K. Agarwal
SIAM Journal on Computing
30
(4), 2000, pp. 1321-1340
Finding sets covering a point with application to mesh-free Galerkin methods
Xiaoxu Han
,
Suely Oliveira
,
David Stewart
SIAM Journal on Computing
30
(4), 2000, pp. 1368-1383
An
O(n \log n)
algorithm for the maximum agreement subtree problem for binary trees
Richard Cole
,
Martin Farach-Colton
,
Ramesh Hariharan
,
Teresa Przytycka
,
Mikkel Thorup
SIAM Journal on Computing
30
(5), 2000, pp. 1385-1404
The WARM-UP algorithm: A Lagrangian construction of length restricted Huffman codes
Ruy Luiz Milidiú
,
Eduardo Sany Laber
SIAM Journal on Computing
30
(5), 2000, pp. 1405-1426
A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction
David Peleg
,
Vitaly Rubinovich
SIAM Journal on Computing
30
(5), 2000, pp. 1427-1442
Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems
Martin E. Dyer
,
Sandeep Sen
SIAM Journal on Computing
30
(5), 2000, pp. 1443-1461
On the relative complexity of resolution refinements and cutting planes proof systems
Maria Luisa Bonet
,
Juan Luis Esteban
,
Nicola Galesi
,
Jan Johannsen
SIAM Journal on Computing
30
(5), 2000, pp. 1462-1484
Randomness is hard
Harry Buhrman
,
Leen Torenvliet
SIAM Journal on Computing
30
(5), 2000, pp. 1485-1501
On the determinization of weighted finite automata
Adam L. Buchsbaum
,
Raffaele Giancarlo
,
Jeffery R. Westbrook
SIAM Journal on Computing
30
(5), 2000, pp. 1502-1531
Algorithms for the relaxed online bin-packing model
Giorgio Gambosi
,
Alberto Postiglione
,
Maurizio Talamo
SIAM Journal on Computing
30
(5), 2000, pp. 1532-1551
Tight bounds for searching a sorted array of strings
Arne Andersson
,
Torben Hagerup
,
Johan Håstad
,
Ola Petersson
SIAM Journal on Computing
30
(5), 2000, pp. 1552-1578
Minimum networks in uniform orientation metrics
M. Brazil
,
D.A. Thomas
,
J.F. Weng
SIAM Journal on Computing
30
(5), 2000, pp. 1579-1593
General dynamic routing with per-packet delay guarantees of
O(distance + 1/session rate)
Matthew Andrews
,
Antonio Fernández
,
Mor Harchol-Balter
,
Tom Leighton
,
Lisa Zhang
SIAM Journal on Computing
30
(5), 2000, pp. 1594-1623
A decomposition theorem for task systems and bounds for randomized server problems
Avrim Blum
,
Howard Karloff
,
Yuval Rabani
,
Michael Saks
SIAM Journal on Computing
30
(5), 2000, pp. 1624-1661
Linear time algorithms for Hamiltonian problems on (claw,net)-free graphs
Andreas Brandstädt
,
Feodor F. Dragan
,
Ekkehard Köhler
SIAM Journal on Computing
30
(5), 2000, pp. 1662-1677
Squarish
k-d
trees
Luc Devroye
,
Jean Jabbour
,
Carlos Zamora-Cura
SIAM Journal on Computing
30
(5), 2000, pp. 1678-1700
Computations of uniform recurrence equations using minimal memory size
Bruno Gaujal
,
Alain Jean-Marie
,
Jean Mairesse
SIAM Journal on Computing
30
(5), 2000, pp. 1701-1738
Approximation algorithms for curvature-constrained shortest paths
Pankaj K. Agarwal
,
Hongyan Wang
SIAM Journal on Computing
30
(6), 2001, pp. 1739-1772
On bipartite drawings and the linear arrangement problem
Farhad Shahrokhi
,
Ondrej Sýkora
,
László A. Székely
,
Imrich Vrt̆o
SIAM Journal on Computing
30
(6), 2001, pp. 1773-1789
Edge-disjoint paths in expander graphs
Alan M. Frieze
SIAM Journal on Computing
30
(6), 2001, pp. 1790-1801
Seiten
<
1
2
3
4
>