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: Author="Shelah, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Universal graphs without large cliques
P. Komjáth
,
S. Shelah
Journal of Combinatorial Theory Series B
63
(1), 1995, pp. 125-135
Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space
Y. Gurevich
,
S. Shelah
Journal of the ACM
37
(3), 1990, July, pp. 674-687
Expected computation time for Hamiltonian path problem
Y. Gurevich
,
S. Shelah
SIAM Journal on Computing
16
(3), 1987, June, pp. 486-502
Threshold spectra for random graphs
S. Shelah
,
J. Spencer
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 421-424
Definability by constant-depth polynomial-size circuits
L. Denenberg
,
Y. Gurevich
,
S. Shelah
Information and Control
70
(2/3), 1986, pp. 216-240
Fixed-point extensions of first-order logic
Y. Gurevich
,
S. Shelah
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 346-353
Expected computation time for Hamiltonian path problem and clique problem
Y. Gurevich
,
S. Shelah
Technical Report (CRL-TR-50-84), 1984, December
Cardinalities definable by constant depth size circuits
L. Denenberg
,
Y. Gurevich
,
S. Shelah
Technical Report (26-83), 1983