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=1988
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A functional approach to data structures and its use in multidimensional searching
Bernard Chazelle
SIAM Journal on Computing
17
, 1988, pp. 427-462
Parallel time
O(\log n)
acceptance of deterministic CFLs on an exclusive-write P-RAM
Philip N. Klein
,
John H. Reif
SIAM Journal on Computing
17
, 1988, pp. 463-485
A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs
Xin He
,
Yaacov Yesha
SIAM Journal on Computing
17
, 1988, pp. 486-491
On search times for early-insertion coalesced hashing
Boris Pittel
,
Jenn-Hwa Yu
SIAM Journal on Computing
17
, 1988, pp. 492-503
Lowness properties of sets in the exponential-time hierarchy
R. Book
,
P. Orponen
,
D. Russo
,
O. Watanabe
SIAM Journal on Computing
17
, 1988, pp. 504-516
Monotone bipartite graph properties are evasive
Andrew Chi-Chih Yao
SIAM Journal on Computing
17
, 1988, pp. 517-520
Distance-hereditary graphs, Steiner trees, and connected domination
Alessandro d'Atri
,
Marina Moscarini
SIAM Journal on Computing
17
, 1988, pp. 521-538
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach
Dorit S. Hochbaum
,
David B. Shmoys
SIAM Journal on Computing
17
, 1988, pp. 539-551
A graph theoretic approach to statistical data security
Dan Gusfield
SIAM Journal on Computing
17
, 1988, pp. 552-571
Minimum spanning trees in
k
-dimensional space
Pravin M. Vaidya
SIAM Journal on Computing
17
, 1988, pp. 572-582
Some geometry for general river routing
Alan Siegel
,
Danny Dolev
SIAM Journal on Computing
17
, 1988, pp. 583-605
Relations between concurrent-write models of parallel computation
Faith E. Fich
,
Prabhakar Ragde
,
Avi Wigderson
SIAM Journal on Computing
17
, 1988, pp. 606-627
Existene, uniqueness, and construction of rewrite systems
Nachum Dershowitz
,
Leo Marcus
,
Andrzej Tarlecki
SIAM Journal on Computing
17
, 1988, pp. 629-639
A new lower bound for the set-partitioning problem
John Welliaveetil John
SIAM Journal on Computing
17
, 1988, pp. 640-647
On the expected sublinearity of the Boyer-Moore algorithm
R. Schaback
SIAM Journal on Computing
17
, 1988, pp. 648-658
Locality, communication, and interconnect length in multicomputers
Paul M.B. Vitányi
SIAM Journal on Computing
17
, 1988, pp. 659-672
Isomorphism testing of unary algebras
Ludȇk Kuc̑era
SIAM Journal on Computing
17
, 1988, pp. 673-686
Efficient parallel evaluation of straight-line code and arithmetic circuits
Gary L. Miller
,
Vijaya Ramachandran
,
Erich Kaltofen
SIAM Journal on Computing
17
, 1988, pp. 687-695
The complexity of near-optimal programmable logic array folding
S.S. Ravi
,
Errol L. Lloyd
SIAM Journal on Computing
17
, 1988, pp. 696-710
Parallel algorithms for term matching
Cynthia Dwork
,
Paris C. Kanellakis
,
Larry Stockmeyer
SIAM Journal on Computing
17
, 1988, pp. 711-731
The probabilistic analysis of a heuristic for the assignment problem
David Avis
,
C.W. Lai
SIAM Journal on Computing
17
, 1988, pp. 732-741
The structure of the stable roommate problem: Efficient representation and enumeration of all stable assignments
Dan Gusfield
SIAM Journal on Computing
17
, 1988, pp. 742-769
Parallel merge sort
Richard Cole
SIAM Journal on Computing
17
, 1988, pp. 770-785
A natural
NP
-complete problem with a nontrivial lower bound
Etienne Grandjean
SIAM Journal on Computing
17
, 1988, pp. 786-809
Scheduling UET systems on two uniform processors and length two pipelines
Harold N. Gabow
SIAM Journal on Computing
17
, 1988, pp. 810-829
Seiten 1
2
3
>