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: Author="Gurevich, Y."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Average case complexity
Y. Gurevich
Lecture Notes in Computer Science
510
, 1991, pp. 615-628
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
Matrix decomposition problem is complete for the average case
Y. Gurevich
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. 802-811
Datalog vs.~first-order logic
M. Ajtai
,
Y. Gurevich
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 142-147
Expected computation time for Hamiltonian path problem
Y. Gurevich
,
S. Shelah
SIAM Journal on Computing
16
(3), 1987, June, pp. 486-502
Complete and incomplete randomized
NP
problems
Y. Gurevich
Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, FOCS'87 (Los Angeles, CA, October 12-14, 1987)
, 1987, pp. 111-117
Definability by constant-depth polynomial-size circuits
L. Denenberg
,
Y. Gurevich
,
S. Shelah
Information and Control
70
(2/3), 1986, pp. 216-240
A zero-one law for logic with a fixed-point operator
A. Blass
,
Y. Gurevich
,
D. Kozen
Information and Control
67
(1-3), 1985, pp. 70-90
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
Equivalence relations, invariants and normal forms
A. Blass
,
Y. Gurevich
SIAM Journal on Computing
13
(4), 1984, November, pp. 682-689
Expected computation time for Hamiltonian path problem and clique problem
Y. Gurevich
,
S. Shelah
Technical Report (CRL-TR-50-84), 1984, December
Solving
NP
-hard problems on graphs that are almost trees and an application to facility location problems
Y. Gurevich
,
L. Stockmeyer
,
U. Vishkin
Journal of the ACM
31
(3), 1984, pp. 459-473
Toward logic tailored for computational complexity
Y. Gurevich
Technical Report (CRL-TR-3-84), 1984, January
Cardinalities definable by constant depth size circuits
L. Denenberg
,
Y. Gurevich
,
S. Shelah
Technical Report (26-83), 1983
Algebras of feasible functions
Y. Gurevich
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 210-214
On the unique satisfiability problem
A. Blass
,
Y. Gurevich
Information and Control
55
(1-3), 1982, pp. 80-88
Trees, automata, and games
Y. Gurevich
,
L. Harrington
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC'82 (San Francisco, CA, May 5-7, 1982)
, 1982, pp. 60-65
The inference problem for template dependencies
Y. Gurevich
,
H.R. Lewis
Information and Control
55
(1-3), 1982, pp. 69-79