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=19
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Deciding equivalence of finite tree automata
Helmut Seidl
SIAM Journal on Computing
19
, 1990, pp. 424-451
Multiplication of polynomials over finite fields
Nader H. Bshouty
,
Michael Kaminski
SIAM Journal on Computing
19
, 1990, pp. 452-456
A class of projective transformations for linear programming
Yinyu Ye
SIAM Journal on Computing
19
, 1990, pp. 457-466
Maximal rank of
mxnx(mn-k)
tensors
Nader H. Bshouty
SIAM Journal on Computing
19
, 1990, pp. 467-471
Flipping persuasively in constant time
Cynthia Dwork
,
David Shmoys
,
Larry Stockmeyer
SIAM Journal on Computing
19
, 1990, pp. 472-499
Reset sequences for monotonic automata
David Eppstein
SIAM Journal on Computing
19
, 1990, pp. 500-510
Fast simulations of time-bounded one-tape Turing machines by space-bounded ones
Maciej Liśkiewicz
,
Krzysztof Loryś
SIAM Journal on Computing
19
, 1990, pp. 511-521
Unbounded searching algorithms
Richard Beigel
SIAM Journal on Computing
19
, 1990, pp. 522-537
The Euclidean algorithm and the degree of the Gauss map
Takis Sakkalis
SIAM Journal on Computing
19
, 1990, pp. 538-543
Group action graphs and parallel architectures
Fred Annexstein
,
Marc Baumslag
,
Arnold L. Rosenberg
SIAM Journal on Computing
19
, 1990, pp. 544-569
Embedding trees in a hypercube is
NP
-complete
A. Wagner
,
D.G. Corneil
SIAM Journal on Computing
19
, 1990, pp. 570-590
The number of shortest paths on the surface of a polyhedron
David M. Mount
SIAM Journal on Computing
19
, 1990, pp. 593-611
Improving the time complexity of message-optimal distributed algorithms for minimum-weight spanning trees
F. Chin
,
H.F. Ting
SIAM Journal on Computing
19
, 1990, pp. 612-626
On the analysis of synchronous computing systems
J.M. Jover
,
T. Kailath
,
H. Lev-Ari
,
S.K. Rao
SIAM Journal on Computing
19
, 1990, pp. 627-643
Partial types and intervals
M. Dezani-Ciancaglini
,
B. Venner
SIAM Journal on Computing
19
, 1990, pp. 644-658
Shortest circuit covers and postman tours in graphs with a nowhere zero 4-flow
Bill Jackson
SIAM Journal on Computing
19
, 1990, pp. 659-665
Greedy matching on the line
Alan Frieze
,
Colin McDiarmid
,
Bruce Reed
SIAM Journal on Computing
19
, 1990, pp. 666-672
A note on Bennett's time-space tradeoff for reversible computation
Robert Y. Levine
,
Alan T. Sherman
SIAM Journal on Computing
19
, 1990, pp. 673-677
Planar depth-first search in
O(\log n)
parallel time
Torben Hagerup
SIAM Journal on Computing
19
, 1990, pp. 678-704
A note on optimal bin packing and optimal bin covering with items of random size
Wansoo T. Rhee
SIAM Journal on Computing
19
, 1990, pp. 705-710
Some observations on parallel algorithms for fast exponentiation in
GF(2^{\pi}
D.R. Stinson
SIAM Journal on Computing
19
, 1990, pp. 711-717
Toward understanding exclusive read
Faith E. Fich
,
Avi Wigderson
SIAM Journal on Computing
19
, 1990, pp. 718-727
Scheduling sequential loops on parallel processors
Ashfaq A. Munshi
,
Barbara Simons
SIAM Journal on Computing
19
, 1990, pp. 728-741
On finding and verifying locally optimal solutions
Mark W. Krentel
SIAM Journal on Computing
19
, 1990, pp. 742-749
The structure of polynomial ideals and Gröbner bases
Thomas W. Dubé
SIAM Journal on Computing
19
, 1990, pp. 750-773
Seiten
<
1
2
3
>