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=24
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Matrix transformation is complete for the average case
Andreas Blass
,
Yuri Gurevich
SIAM Journal on Computing
24
(1), 1995, February, pp. 3-29
Tighter lower bounds on the exact complexity of string matching
Richard Cole
,
Ramesh Hariharan
,
Mike Paterson
,
Uri Zwick
SIAM Journal on Computing
24
(1), 1995, February, pp. 30-45
Planar strong connectivity helps in parallel depth-first search
Ming-Yang Kao
SIAM Journal on Computing
24
(1), 1995, February, pp. 46-62
Fast parallel computation of the polynomial remainder sequence via Bézout and Hankel matrices
Dario Bini
,
Luca Gemignani
SIAM Journal on Computing
24
(1), 1995, February, pp. 63-77
A graph-theoretic game and its application to the
k
-server problem
Noga Alon
,
Richard M. Karp
,
David Peleg
,
Douglas West
SIAM Journal on Computing
24
(1), 1995, February, pp. 78-100
Finding
k
cuts within twice the optimal
Huzur Saran
,
Vijay V. Vazirani
SIAM Journal on Computing
24
(1), 1995, February, pp. 101-108
The serial transitive closure problem for trees
Maria Luisa Bonet
,
Samuel R. Buss
SIAM Journal on Computing
24
(1), 1995, February, pp. 109-122
New decidability results concerning two-way counter machines
Oscar H. Ibarra
,
Tao Jiang
,
Nicholas Tran
,
Hui Wang
SIAM Journal on Computing
24
(1), 1995, February, pp. 123-137
On the optimality of randomized
\alpha
-
\beta
search
Yanjun Zhang
SIAM Journal on Computing
24
(1), 1995, February, pp. 138-147
Greedy packet scheduling
Israel Cidon
,
Shay Kutten
,
Yishay Mansour
,
David Peleg
SIAM Journal on Computing
24
(1), 1995, February, pp. 148-157
Optimal file sharing in distributed networks
Moni Naor
,
Ron M. Roth
SIAM Journal on Computing
24
(1), 1995, February, pp. 158-183
An optimal algorithm for computing visibility in the plane
Paul J. Heffernan
,
Joseph S.B. Mitchell
SIAM Journal on Computing
24
(1), 1995, February, pp. 184-201
A randomized maximum-flow algorithm
Joseph Cheriyan
,
Torben Hagerup
SIAM Journal on Computing
24
(2), 1995, pp. 203-226
Sparse approximate solutions to linear systems
B.K. Natarajan
SIAM Journal on Computing
24
(2), 1995, pp. 227-234
A heuristic scheduling of independent tasks with bottleneck resource constraints
Qingzhou Wang
,
Ernst L. Leiss
SIAM Journal on Computing
24
(2), 1995, pp. 235-241
On computing algebraic functions using logarithms and exponentials
Dima Grigoriev
,
Michael Singer
,
Andrew Yao
SIAM Journal on Computing
24
(2), 1995, pp. 242-246
Algorithms for enumerating all spanning trees of undirected and weighted graphs
Sanjiv Kapoor
,
H. Ramesh
SIAM Journal on Computing
24
(2), 1995, pp. 247-265
Permuting in place
Faith E. Fich
,
J. Ian Munro
,
Patricio V. Poblete
SIAM Journal on Computing
24
(2), 1995, pp. 266-278
The complexity and distribution of hard problems
David W. Juedes
,
Jack H. Lutz
SIAM Journal on Computing
24
(2), 1995, pp. 279-295
A general approximation technique for constrained forest problems
Michel X. Goemans
,
David P. Williamson
SIAM Journal on Computing
24
(2), 1995, pp. 296-317
\mbox{D}^{over}
: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems
Gilad Koren
,
Dennis Shasha
SIAM Journal on Computing
24
(2), 1995, pp. 318-339
Ordered and unordered tree inclusion
Pekka Kilpeläinen
,
Heikki Mannila
SIAM Journal on Computing
24
(2), 1995, pp. 340-356
Randomized interpolation and approximation of sparse polynomials
Yishay Mansour
SIAM Journal on Computing
24
(2), 1995, pp. 357-368
An
NC
algorithm for evaluating monotone planar circuits
A.L. Delcher
,
S. Rao Kosaraju
SIAM Journal on Computing
24
(2), 1995, pp. 369-375
Private computations over the integers
Benny Chor
,
Mihály Geréb-Graus
,
Eyal Kushilevitz
SIAM Journal on Computing
24
(2), 1995, pp. 376-386
Seiten 1
2
3
4
>