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="Seiferas, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A variant of Ben-Or's lower bound for algebraic decision trees
J. Seiferas
Information Processing Letters
26
(5), 1988, January, pp. 273-276
A simplified lower bound for context-free-language recognition
J.I. Seiferas
Information and Control
69
(1-3), 1986, pp. 255-260
The smallest automaton recognizing the subwords of a text
A. Blumer
,
J. Blumer
,
D. Haussler
,
A. Ehrenfeucht
,
M.T. Chen
,
J. Seiferas
Theoretical Computer Science
40
(1), 1985, pp. 31-55
Time-space-optimal string matching
Z. Galil
,
J. Seiferas
Journal of Computer and System Sciences
26
(3), 1983, June, pp. 280-294
Linear-time string-matching using only a fixed number of local storage locations (Note)
Z. Galil
,
J. Seiferas
Theoretical Computer Science
13
, 1981, pp. 331-336
Time-space-optimal string matching
Z. Galil
,
J. Seiferas
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC'81 (Milwaukee, WI, May 11-13, 1981)
, 1981, pp. 106-113
Saving space in fast string-matching
Z. Galil
,
J. Seiferas
SIAM Journal on Computing
9
(2), 1980, May, pp. 417-438
An information-theoretic approach to time bounds for on-line computation
W.J. Paul
,
J.I. Seiferas
,
J. Simon
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, STOC'80 (Los Angeles, CA, April 28-30, 1980)
, 1980, pp. 357-367
A linear-time on-line recognition algorithm for ``Palstar''
Z. Galil
,
J. Seiferas
Journal of the ACM
25
, 1978, pp. 102-111
Separating nondeterministic time complexity classes
J.I. Seiferas
,
M.J. Fischer
,
A.R. Meyer
Journal of the ACM
25
, 1978, pp. 146-167
Correcting counter-automaton-recognizable languages
R.A. Wagner
,
J.I. Seiferas
SIAM Journal on Computing
7
(3), 1978, August, pp. 357-375
Saving space in fast string-matching
Z. Galil
,
J. Seiferas
Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, FOCS'77 (Providence, RI, October 31 - November 2, 1977)
, 1977, pp. 179-188
New real-time simulations of multihead tape units
B. Leong
,
J. Seiferas
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, STOC'77 (Boulder, CO, May 2-4, 1977)
, 1977, pp. 239-248
Linear-time computation by nondeterministic multidimensional iterative arrays
J.I. Seiferas
SIAM Journal on Computing
6
(3), 1977, September, pp. 487-504
Relating refined space complexity classes
J.I. Seiferas
Journal of Computer and System Sciences
14
(1), 1977, February, pp. 100-129
Techniques for separating space complexity classes
J.I. Seiferas
Journal of Computer and System Sciences
14
(1), 1977, February, pp. 73-99
Iterative arrays with direct central control
J.I. Seiferas
Acta Informatica
8
(2), 1977, pp. 177-192
Recognizing certain repetitions and reversals within strings
Z. Galil
,
J. Seiferas
Proceedings of the 17th Annual IEEE Symposium on Foundations of Computer Science, FOCS'76 (Houston, TX, October 25-27, 1976)
, 1976, pp. 236-252
Regularity-preserving relations
J.I. Seiferas
,
R. McNaughton
Theoretical Computer Science
2
(2), 1976, pp. 147-154
Observations on nondeterministic multidimensional iterative arrays
J.I. Seiferas
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, STOC'74 (Seattle, WA, April 30 - May 2, 1974)
, 1974, pp. 276-289
Refinements of the nondeterministic time and space hierarchies
J. Seiferas
,
M. Fischer
,
A. Meyer
misc, pp. 130-137
Counting is easy (preliminary version)
J. Seiferas
,
P.M.B. Vitányi
misc (CS-R8423)