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
[1]
Hilfe
Suche: Booktitle=Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Competitive
k
-server algorithms
A. Fiat
,
Y. Rabani
,
Y. Ravid
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 454-463
Randomized online graph coloring
S. Vishwanathan
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 464-469
Coloring inductive graphs on-line
S. Irani
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 470-479
Online algorithms for finger searching
R. Cole
,
A. Raghunathan
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 480-489
Communication-optimal maintenance of replicated information
B. Awerbuch
,
I. Cidon
,
S. Kutten
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 492-502
Sparse partitions
B. Awerbuch
,
D. Peleg
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 503-513
Network synchronization with polylogarithmic overhead
B. Awerbuch
,
D. Peleg
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 514-522
General weak random sources
D. Zuckerman
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 534-543
Simple constructions of almost
k
-wise independent random variables
N. Alon
,
O. Goldreich
,
J. Håstad
,
R. Peralta
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 544-553
Some tools for approximate 3-coloring
A. Blum
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 554-562
Randomness in interactive proofs
M. Bellare
,
O. Goldreich
,
S. Goldwasser
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 563-572
Parallel linear programming in fixed dimension almost surely in constant time
N. Alon
,
N. Megiddo
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 574-582
Reducing the parallel complexity of certain linear programming problems
P.M. Vaidya
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 583-589
Asynchronous PRAMs are (almost) as good as synchronous PRAMs
C. Martel
,
R. Subramonian
,
A. Park
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 590-599
Uniform memory hierarchies
B. Alpern
,
L. Carter
,
E. Feig
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 600-608
On the power of small-depth threshold circuits
J. Håstad
,
M. Goldmann
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 610-618
On ACC and threshold circuits
A.C.-C. Yao
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 619-627
On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates
R. Smolensky
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 628-631
Polynomial threshold functions,
AC^0
functions and spectral norms
J. Bruck
,
R. Smolensky
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 632-641
Faster circuits and shorter formulae for multiple addition, multiplication and symmetric Boolean functions
M.S. Paterson
,
N. Pippenger
,
U. Zwick
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 642-650
Deciding properties of nonregular programs
D. Harel
,
D. Raz
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 652-661
Decision problems for propositional linear logic
P. Lincoln
,
J. Mitchell
,
A. Scedrov
,
N. Shankar
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 662-671
Tight bounds on the complexity of cascaded decomposition of automata
O. Maler
,
A. Pnueli
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 672-682
Finite-memory automata
M. Kaminski
,
N. Francez
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 683-688
Probabilities of sentences about very sparse random graphs
J.F. Lynch
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~II, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 689-696
Seiten 1
2
>