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=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An optimal linear-time parallel parser for tree adjoining languages
Michael A. Palis
,
Sunil Shende
,
David S.L. Wei
SIAM Journal on Computing
19
, 1990, pp. 1-31
Complexity and unsolvability properties of nilpotency
I.R. Hentzel
,
D. Pokrass Jacobs
SIAM Journal on Computing
19
, 1990, pp. 32-43
The complexity of very simple Boolean formulas with application
H.B. Hunt III
,
R.E. Stearns
SIAM Journal on Computing
19
, 1990, pp. 44-70
Lower bounds for the stable marriage problem and its variants
Cheng Ng
,
Daniel S. Hirschberg
SIAM Journal on Computing
19
, 1990, pp. 71-77
A rewriting system for categorical combinators with multiple arguments
Hirofumi Yokouchi
,
Teruo Hikita
SIAM Journal on Computing
19
, 1990, pp. 78-97
The inverses of block Hankel and block Toeplitz matrices
George Labahn
,
Dong Koo Choi
,
Stan Cabay
SIAM Journal on Computing
19
, 1990, pp. 98-123
A density theorem for purely iterative zero finding methods
Joel Friedman
SIAM Journal on Computing
19
, 1990, pp. 124-132
A fast parallel Horner algorithm
Michael L. Dowling
SIAM Journal on Computing
19
, 1990, pp. 133-142
Very simple methods for all pairs network flow analysis
Dan Gusfield
SIAM Journal on Computing
19
, 1990, pp. 143-155
On the expected capacity of binomial and random concentrators
Edward R. Scheinerman
SIAM Journal on Computing
19
, 1990, pp. 156-163
Space-efficient message routing in
c
-decomposable networks
Greg N. Frederickson
,
Ravi Janardan
SIAM Journal on Computing
19
, 1990, pp. 164-181
Feasible real functions and arithmetic circuits
H. James Hoover
SIAM Journal on Computing
19
, 1990, pp. 182-204
Reversal complexity classes for alternating Turing machines
Mirosƚaw Kutyƚowski
,
Maciej Liśkiewicz
,
Krzysztof Loryś
SIAM Journal on Computing
19
, 1990, pp. 207-221
The complexity of file transfer scheduling with forwarding
Jennifer Whitehead
SIAM Journal on Computing
19
, 1990, pp. 222-245
Characterization of associative operations with prefix circuits of constant depth and linear size
G. Bilardi
,
F.P. Preparata
SIAM Journal on Computing
19
, 1990, pp. 246-255
A time-randomness trade-off for oblivious routing
David Peleg
,
Eli Upfal
SIAM Journal on Computing
19
, 1990, pp. 256-266
A heuristic algorithm for small separators in arbitrary graphs
David A. Plaisted
SIAM Journal on Computing
19
, 1990, pp. 267-280
On the efficient generation of language instances
Laura A. Sanchis
,
Mark A. Fulk
SIAM Journal on Computing
19
, 1990, pp. 281-296
Red-blue intersection detection algorithms, with applications to motion planning and collision detection
Pankaj K. Agarwal
,
Micha Sharir
SIAM Journal on Computing
19
, 1990, pp. 297-321
Towards an architecture-independent analysis of parallel algorithms
Christos H. Papadimitriou
,
Mihalis Yannakakis
SIAM Journal on Computing
19
, 1990, pp. 322-328
Addition machines
Robert W. Floyd
,
Donald E. Knuth
SIAM Journal on Computing
19
, 1990, pp. 329-340
Semantic correctness for a parallel object-oriented language
J.J.M.M. Rutten
SIAM Journal on Computing
19
, 1990, pp. 341-383
On the decomposability of
NC
and
AC
Christopher B. Wilson
SIAM Journal on Computing
19
, 1990, pp. 384-396
Parallel depth-first search in general directed graphs
Alok Aggarwal
,
Richard J. Anderson
,
Ming-Yang Kao
SIAM Journal on Computing
19
, 1990, pp. 397-409
Expressibility and nonuniform complexity classes
B. Molzan
SIAM Journal on Computing
19
, 1990, pp. 411-423
Seiten 1
2
3
>