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=36
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Scheduling split intervals
R. Bar-Yehuda
,
M.M. Halldórsson
,
J.(S.) Naor
,
H. Shachnai
,
I. Shapira
SIAM Journal on Computing
36
(1), 2006, pp. 1-15
A simple algorithm for Mal'tsev constraints
Andrei Bulatov
,
Víctor Dalmau
SIAM Journal on Computing
36
(1), 2006, pp. 16-27
Identifying clusters from positive data
John Case
,
Sanjay Jain
,
Eric Martin
,
Arun Sharma
,
Frank Stephan
SIAM Journal on Computing
36
(1), 2006, pp. 28-55
Fault-tolerant gathering algorithms for autonomous mobile robots
Noa Agmon
,
David Peleg
SIAM Journal on Computing
36
(1), 2006, pp. 56-82
Disproving the single level conjecture
Stasys Jukna
SIAM Journal on Computing
36
(1), 2006, pp. 83-98
Reconstructing chromosomal evolution
Li-San Wang
,
Tandy Warnow
SIAM Journal on Computing
36
(1), 2006, pp. 99-131
Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication
Petros Drineas
,
Ravi Kannan
,
Michael W. Mahoney
SIAM Journal on Computing
36
(1), 2006, pp. 132-157
Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix
Petros Drineas
,
Ravi Kannan
,
Michael W. Mahoney
SIAM Journal on Computing
36
(1), 2006, pp. 158-183
Fast Monte Carlo algorithms for matrices III: Computing a compressed approximate matrix decomposition
Petros Drineas
,
Ravi Kannan
,
Michael W. Mahoney
SIAM Journal on Computing
36
(1), 2006, pp. 184-206
A complete classification of the complexity of propositional abduction
Nadia Creignou
,
Bruno Zanuttini
SIAM Journal on Computing
36
(1), 2006, pp. 207-229
Full constraint satisfaction problems
Tomas Feder
,
Pavol Hell
SIAM Journal on Computing
36
(1), 2006, pp. 230-246
Rapidly mixing Markov chains for sampling contingency tables with a constant number of rows
Mary Cryan
,
Martin Dyer
,
Leslie Ann Goldberg
,
Mark Jerrum
,
Russell Martin
SIAM Journal on Computing
36
(1), 2006, pp. 247-278
Erratum to ''Distributed anonymous mobile robots: Formation of geometric patterns''
Ichiro Suzuki
,
Masafumi Yamashita
SIAM Journal on Computing
36
(1), 2006, pp. 279-280
Dominating sets in planar graphs: Branch-width and exponential speed-up
Fedor V. Fomin
,
Dimitrios M. Thilikos
SIAM Journal on Computing
36
(2), 2006, pp. 281-309
Between
O(nm)
and
O(n^\alpha)
Dieter Kratsch
,
Jeremy Spinrad
SIAM Journal on Computing
36
(2), 2006, pp. 310-325
Certifying algorithms for recognizing interval graphs and permutation graphs
Dieter Kratsch
,
Ross M. McConnell
,
Kurt Mehlhorn
,
Jeremy P. Spinrad
SIAM Journal on Computing
36
(2), 2006, pp. 326-353
Lower bounds for on-line graph problems with application to on-line circuit and optical routing
Yair Bartal
,
Amos Fiat
,
Stefano Leonardi
SIAM Journal on Computing
36
(2), 2006, pp. 354-393
Efficient bundle sorting
Yossi Matias
,
Eran Segal
,
Jeffrey Scott Vitter
SIAM Journal on Computing
36
(2), 2006, pp. 394-410
Approximation algorithms for metric facility location problems
Mohammad Mahdian
,
Yinyu Ye
,
Jiawei Zhang
SIAM Journal on Computing
36
(2), 2006, pp. 411-432
An unconditional lower bound on the time-approximation trade-off for the distributed minimum spanning tree problem
Michael Elkin
SIAM Journal on Computing
36
(2), 2006, pp. 433-456
Toward a topological characterization of asynchronous complexity
Gunnar Hoest
,
Nir Shavit
SIAM Journal on Computing
36
(2), 2006, pp. 457-497
Covering problems with hard capacities
Julia Chuzhoy
,
Joseph (Seffi) Naor
SIAM Journal on Computing
36
(2), 2006, pp. 498-515
Properties of
NP
-complete sets
Christian Glaßer
,
A. Pavan
,
Alan L. Selman
,
Samik Sengupta
SIAM Journal on Computing
36
(2), 2006, pp. 516-542
The directed Steiner network problem is tractable for a constant number of terminals
Jon Feldman
,
Matthias Ruhl
SIAM Journal on Computing
36
(2), 2006, pp. 543-561
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
Scott Diehl
,
Dieter van Melkebeek
SIAM Journal on Computing
36
(3), 2006, pp. 563-594
Seiten 1
2
3
>