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 YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Models for random constraint satisfaction problems
Michael Molloy
SIAM Journal on Computing
32
(4), 2003, pp. 935-949
Macro tree translations of linear size increase are MSO definable
Joost Engelfriet
,
Sebastian Maneth
SIAM Journal on Computing
32
(4), 2003, pp. 950-1006
The impact of timing knowledge on the session problem
Injong Rhee
,
Jennifer L. Welch
SIAM Journal on Computing
32
(4), 2003, pp. 1007-1039
Multirate rearrangeable Clos networks and a generalized edge-coloring problem on bipartite graphs
Hung Q. Ngo
,
Van H. Vu
SIAM Journal on Computing
32
(4), 2003, pp. 1040-1049
An approximation algorithm for the minimum-cost
k
-vertex connected subgraph
Joseph Cheriyan
,
Santosh Vempala
,
Adrian Vetta
SIAM Journal on Computing
32
(4), 2003, pp. 1050-1055
Tree pattern matching to subset matching in linear time
Richard Cole
,
Ramesh Hariharan
SIAM Journal on Computing
32
(4), 2003, pp. 1056-1066
Revisiting Tucker's algorithm to color circular arc graphs
Mario Valencia-Pabon
SIAM Journal on Computing
32
(4), 2003, pp. 1067-1072
Genetic design of drugs without side-effects
Xiaotie Deng
,
Guojun Li
,
Zimao Li
,
Bin Ma
,
Lusheng Wang
SIAM Journal on Computing
32
(4), 2003, pp. 1073-1090
Windows scheduling problems for broadcast systems
Amotz Bar-Noy
,
Richard E. Ladner
SIAM Journal on Computing
32
(4), 2003, pp. 1091-1113
A polynomial-time algorithm for near-perfect phylogeny
David Fernández-Baca
,
Jens Lagergren
SIAM Journal on Computing
32
(5), 2003, pp. 1115-1127
The 3-colorability problem on graphs with maximum degree four
Martin Kochol
,
Vadim Lozin
,
Bert Randerath
SIAM Journal on Computing
32
(5), 2003, pp. 1128-1139
Algorithms for Boolean function query properties
Scott Aaronson
SIAM Journal on Computing
32
(5), 2003, pp. 1140-1157
On testing convexity and submodularity
Michal Parnas
,
Dana Ron
,
Ronitt Rubinfeld
SIAM Journal on Computing
32
(5), 2003, pp. 1158-1184
Lower bounds for matrix product
Amir Shpilka
SIAM Journal on Computing
32
(5), 2003, pp. 1185-1200
Searching for sorted sequences of kings in tournaments
Jian Shen
,
Li Sheng
,
Jie Wu
SIAM Journal on Computing
32
(5), 2003, pp. 1201-1209
An optimal algorithm for checking regularity
Y. Kohayakawa
,
V. Rödl
,
L. Thoma
SIAM Journal on Computing
32
(5), 2003, pp. 1210-1235
Dimension in complexity classes
Jack H. Lutz
SIAM Journal on Computing
32
(5), 2003, pp. 1236-1259
The natural work-stealing algorithm is stable
Petra Berenbrink
,
Tom Friedetzky
,
Leslie Ann Goldberg
SIAM Journal on Computing
32
(5), 2003, pp. 1260-1279
The algebraic approach to the discrete cosine and sine transforms and their fast algorithms
Markus Püschel
,
José M.F. Moura
SIAM Journal on Computing
32
(5), 2003, pp. 1280-1316
Approximation schemes for minimum latency problems
Sanjeev Arora
,
George Karakostas
SIAM Journal on Computing
32
(5), 2003, pp. 1317-1337
Reachability and distance queries via 2-hop labels
Edith Cohen
,
Eran Halperin
,
Haim Kaplan
,
Uri Zwick
SIAM Journal on Computing
32
(5), 2003, pp. 1338-1355
On the complexity of matrix product
Ran Raz
SIAM Journal on Computing
32
(5), 2003, pp. 1356-1369
Minimizing total completion time on parallel machines with deadline constraints
Joseph Y.-T. Leung
,
Michael Pinedo
SIAM Journal on Computing
32
(5), 2003, pp. 1370-1388
Kolmogorov complexity and deterministic context-free languages
Oliver Glier
SIAM Journal on Computing
32
(5), 2003, pp. 1389-1394
Finding a path of superlogarithmic length
Andreas Björklund
,
Thore Husfeldt
SIAM Journal on Computing
32
(6), 2003, pp. 1395-1402
Seiten
<
1
2
3
4
>