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
[1]
Hilfe
Suche: Journal=SIAM J. Comput. AND YEAR=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Stochastic relations: Congruences, bisimulations and the Hennessy-Milner theorem
Ernst-Erich Doberkat
SIAM Journal on Computing
35
(3), 2005-2006, pp. 590-626
Sublinear geometric algorithms
Bernard Chazelle
,
Ding Liu
,
Avner Magen
SIAM Journal on Computing
35
(3), 2005-2006, pp. 627-646
Lowness for the class of Schnorr random reals
Bjrn Kjos-Hanssen
,
André Nies
,
Frank Stephan
SIAM Journal on Computing
35
(3), 2005-2006, pp. 647-657
An efficient algorithm for computing optimal discrete voltage schedules
Minming Li
,
Frances F. Yao
SIAM Journal on Computing
35
(3), 2005-2006, pp. 658-671
A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem
Michael Elkin
,
Guy Kortsarz
SIAM Journal on Computing
35
(3), 2005-2006, pp. 672-689
The computational complexity of Tutte invariants for planar graphs
Dirk Vertigan
SIAM Journal on Computing
35
(3), 2005-2006, pp. 690-712
A polynomial time approximation scheme for the multiple knapsack problem
Chandra Chekuri
,
Sanjeev Khanna
SIAM Journal on Computing
35
(3), 2005-2006, pp. 713-728
The rectilinear Steiner arborescence problem is
NP
-complete
Weiping Shi
,
Chen Su
SIAM Journal on Computing
35
(3), 2005-2006, pp. 729-740
Mapping cycles and trees on wrap-around butterfly graphs
Meghanad D. Wagh
,
Osman Guzide
SIAM Journal on Computing
35
(3), 2005-2006, pp. 741-765
WDM switching networks, rearrangeable and nonblocking
[w,f]
-connectors
Hung Q. Ngo
SIAM Journal on Computing
35
(3), 2005-2006, pp. 766-785
Approximating the cut-norm via Grothendieck's inequality
Noga Alon
,
Assaf Naor
SIAM Journal on Computing
35
(4), 2006, pp. 787-803
Lower bounds for local search by quantum arguments
Scott Aaronson
SIAM Journal on Computing
35
(4), 2006, pp. 804-824
Approximating fractional packings and coverings in
O(1/\epsilon)
iterations
D. Bienstock
,
G. Iyengar
SIAM Journal on Computing
35
(4), 2006, pp. 825-854
Typical properties of winners and losers in discrete optimization
Rene Beier
,
Berthold Vöcking
SIAM Journal on Computing
35
(4), 2006, pp. 855-881
Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus
Jonathan A. Kelner
SIAM Journal on Computing
35
(4), 2006, pp. 882-902
Using nondeterminism to amplify hardness
Alexander Healy
,
Salil Vadhan
,
Emanuele Viola
SIAM Journal on Computing
35
(4), 2006, pp. 903-931
Logarithmic lower bounds in the cell-probe model
Mihai Pȃtraşcu
,
Erik D. Demaine
SIAM Journal on Computing
35
(4), 2006, pp. 932-963
On sums of independent random variables with unbounded variance and estimating the average degree in a graph
Uriel Feige
SIAM Journal on Computing
35
(4), 2006, pp. 964-984
Hit-and-run from a corner
László Lovász
,
Santosh Vempala
SIAM Journal on Computing
35
(4), 2006, pp. 985-1005
Function matching
Amihood Amir
,
Yonatan Aumann
,
Moshe Lewenstein
,
Ely Porat
SIAM Journal on Computing
35
(5), 2006, pp. 1007-1022
Finding four independent trees
Sean Curran
,
Orlando Lee
,
Xingxing Yu
SIAM Journal on Computing
35
(5), 2006, pp. 1023-1058
Efficient simulations by queue machines
Holger Petersen
,
John Michael Robson
SIAM Journal on Computing
35
(5), 2006, pp. 1059-1069
The complexity of the local Hamiltonian problem
Julia Kempe
,
Alexei Kitaev
,
Oded Regev
SIAM Journal on Computing
35
(5), 2006, pp. 1070-1097
Algorithms for combining rooted triplets into a galled phylogenetic network
Jesper Jansson
,
Nguyen Bao Nguyen
,
Wing-Kin Sung
SIAM Journal on Computing
35
(5), 2006, pp. 1098-1121
Certifying polynomial time and linear/polynomial space for imperative programs
Karl-Heinz Niggl
,
Henning Wunderlich
SIAM Journal on Computing
35
(5), 2006, pp. 1122-1147
Seiten
<
1
2
3
4
>