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=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Hypercubic sorting networks
Tom Leighton
,
C. Greg Plaxton
SIAM Journal on Computing
27
(1), 1998, pp. 1-47
The shrinkage exponent of de Morgan formulas is 2
Johan Håstad
SIAM Journal on Computing
27
(1), 1998, pp. 48-64
Shared memory consistency conditions for nonsequential execution: Definitions and programming strategies
Hagit Attiya
,
Soma Chaudhuri
,
Roy Friedman
,
Jennifer L. Welch
SIAM Journal on Computing
27
(1), 1998, pp. 65-89
Two-dimensional periodicity in rectangular arrays
Amihood Amir
,
Gary Benson
SIAM Journal on Computing
27
(1), 1998, pp. 90-106
A fast discrete approximation algorithm for the Radon transform
Martin L. Brady
SIAM Journal on Computing
27
(1), 1998, pp. 107-119
Value sets of some polynomials over finite fields
GF(2^{2m})
Thomas W. Cusick
SIAM Journal on Computing
27
(1), 1998, pp. 120-131
Optimal upward planarity testing of single-source digraphs
Paola Bertolazzi
,
Giuseppe di Battista
,
Carlo Mannino
,
Roberto Tamassia
SIAM Journal on Computing
27
(1), 1998, pp. 132-169
Linear and
O(n \log n)
time minimum-cost matching algorithms for quasi-convex tours
Samuel R. Buss
,
Peter N. Yianilos
SIAM Journal on Computing
27
(1), 1998, pp. 170-201
Space-efficient scheduling of multithreaded computations
Robert D. Blumofe
,
Charles E. Leiserson
SIAM Journal on Computing
27
(1), 1998, pp. 202-229
Simulating threshold circuits by majority circuits
Mikael Goldmann
,
Marek Karpinski
SIAM Journal on Computing
27
(1), 1998, pp. 230-246
Fully polynomial Byzantine agreement for
n > 3t
processors in
t+1
rounds
Juan A. Garay
,
Yoram Moses
SIAM Journal on Computing
27
(1), 1998, pp. 247-290
An
O(\log k)
approximate min-cut max-flow theorem and approximation algorithm
Yonatan Aumann
,
Yuval Rabani
SIAM Journal on Computing
27
(1), 1998, pp. 291-301
A sublinear time distributed algorithm for minimum-weight spanning trees
Juan A. Garay
,
Shay Kutten
,
David Peleg
SIAM Journal on Computing
27
(1), 1998, pp. 302-316
Erratum to ''Conditions for optimality of the Huffman algorithm''
D. Stott, Jr. Parker
SIAM Journal on Computing
27
(1), 1998, pp. 317-317
Atomic snapshots in
O(n \log n)
operations
Hagit Attiya
,
Ophir Rachman
SIAM Journal on Computing
27
(2), 1998, pp. 319-340
Circuit bottom fan-in and computational power
Liming Cai
,
Jianer Chen
,
Johan Håstad
SIAM Journal on Computing
27
(2), 1998, pp. 341-355
On the complexity of computing mixed volumes
Martin Dyer
,
Peter Gritzmann
,
Alexander Hufnagel
SIAM Journal on Computing
27
(2), 1998, pp. 356-400
Interpolating arithmetic read-once formulas in parallel
Nader H. Bshouty
,
Richard Cleve
SIAM Journal on Computing
27
(2), 1998, pp. 401-413
An on-line algorithm for some uniform processor scheduling
Rongheng Li
,
Lijie Shi
SIAM Journal on Computing
27
(2), 1998, pp. 414-422
The load, capacity, and availability of quorum systems
Moni Naor
,
Avishai Wool
SIAM Journal on Computing
27
(2), 1998, pp. 423-447
Space-efficient deterministic simulation of probabilistic automata
Ioan I. Macarie
SIAM Journal on Computing
27
(2), 1998, pp. 448-465
Efficient matrix chain ordering in polylog time
Phillip G. Bradford
,
Gregory J.E. Rawlins
,
Gregory E. Shannon
SIAM Journal on Computing
27
(2), 1998, pp. 466-490
Computing many faces in arrangements of lines and segments
Pankaj K. Agarwal
,
Jiȓí Matous̑ek
,
Otfried Schwarzkopf
SIAM Journal on Computing
27
(2), 1998, pp. 491-505
Fault-tolerant computation in the full information model
Oded Goldreich
,
Shafi Goldwasser
,
Nathan Linial
SIAM Journal on Computing
27
(2), 1998, pp. 506-544
A spectral approach to lower bounds with applications to geometric searching
Bernard Chazelle
SIAM Journal on Computing
27
(2), 1998, pp. 545-556
Seiten 1
2
3
4
>