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.
Efficient dynamic traitor tracing
Omer Berkman
,
Michal Parnas
,
Jiȓí Sgall
SIAM Journal on Computing
30
(6), 2001, pp. 1802-1828
Quantum entanglement and communication complexity
Harry Buhrman
,
Richard Cleve
,
Wim van Dam
SIAM Journal on Computing
30
(6), 2001, pp. 1829-1841
Regular languages are testable with a constant number of queries
Noga Alon
,
Michael Krivelevich
,
Ilan Newman
,
Mario Szegedy
SIAM Journal on Computing
30
(6), 2001, pp. 1842-1862
The approximability of constraint satisfaction problems
Sanjeev Khanna
,
Madhu Sudan
,
Luca Trevisan
,
David P. Williamson
SIAM Journal on Computing
30
(6), 2001, pp. 1863-1920
Dual-issue scheduling for binary trees with spills and pipelined loads
Waleed M. Meleis
SIAM Journal on Computing
30
(6), 2001, pp. 1921-1941
A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
Tao Jiang
,
Paul Kearney
,
Ming Li
SIAM Journal on Computing
30
(6), 2001, pp. 1942-1961
An extension of path coupling and its application to the Glauber dynamics for graph colorings
Martin Dyer
,
Leslie Ann Goldberg
,
Catherine Greenhill
,
Mark Jerrum
,
Michael Mitzenmacher
SIAM Journal on Computing
30
(6), 2001, pp. 1962-1975
Optimal simulations between unary automata
Carlo Mereghetti
,
Giovanni Pighizzini
SIAM Journal on Computing
30
(6), 2001, pp. 1976-1992
An approximation algorithm for feedback vertex sets in tournaments
Mao-cheng Cai
,
Xiaotie Deng
,
Wenan Zang
SIAM Journal on Computing
30
(6), 2001, pp. 1993-2007
The shortest vector in a lattice is hard to approximate to within some constant
Daniele Micciancio
SIAM Journal on Computing
30
(6), 2001, pp. 2008-2035
Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
Endre Boros
,
Vladimir Gurvich
,
Leonid Khachiyan
,
Kazuhisa Makino
SIAM Journal on Computing
30
(6), 2001, pp. 2036-2050
A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
Aravind Srinivasan
,
Chung-Piaw Teo
SIAM Journal on Computing
30
(6), 2001, pp. 2051-2068
Variable-sized bin packing: Tight absolute worst-case performance ratios for four approximation algorithms
Chengbin Chu
,
Rémy La
SIAM Journal on Computing
30
(6), 2001, pp. 2069-2083
First-order specifications of programmable data types
Grażyna Mirkowska
,
Andrzej Salwicki
,
Marian Srebrny
,
Andrzej Tarlecki
SIAM Journal on Computing
30
(6), 2001, pp. 2084-2096
Seiten
<
1
2
3
4