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="Schnitger, G."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nondeterministic communication with a limited number of advice bits
J. Hromkovic
,
G. Schnitger
Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pennsylvania, May 22-24, 1996)
, 1996, pp. 551-560
Communication complexity of matrix computation over finite fields
J.I. Chu
,
G. Schnitger
Math. Systems Theory
28
(3), 1995, pp. 215-228
The communication complexity of several problems in matrix computation
J. Chu
,
G. Schnitger
Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'89 (Santa Fe, New Mexico, June 18-21, 1989)
, 1989, pp. 22-31
Lower bounds on communication complexity
P. Durivs
,
Z. Galil
,
G. Schnitger
Information and Computation
73
(1), 1987, pp. 1-22
The probabilistic communication complexity of set intersection
B. Kalyanasundaram
,
G. Schnitger
Proceedings of the 2nd Annual Conference on Structure in Complexity Theory, CSCT'87 (Cornell University, Ithaca, NY, June 16-19, 1987)
, 1987, pp. 41-47
Two tapes are better than one for off-line Turing machines
W. Maass
,
G. Schnitger
,
E. Szemerédi
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 94-100
An optimal lower bound for Turing machines with one work tape and a two-way input tape
W. Maass
,
G. Schnitger
Lecture Notes in Computer Science
223
, 1986, pp. 249-264
Parallel computation with threshold functions
I. Parberry
,
G. Schnitger
Lecture Notes in Computer Science
223
, 1986, pp. 272-290
Lower bounds on communication complexity
P. Durivs
,
Z. Galil
,
G. Schnitger
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, STOC'84 (Washington, DC, April 30 - May 2, 1984)
, 1984, pp. 81-91
On depth-reduction and grates
G. Schnitger
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 323-328
Three appliactions of Kolmogorov-complexity
S. Reisch
,
G. Schnitger
Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'82 (Chicago, IL, November 3-5, 1982)
, 1982, pp. 45-52
A family of graphs with expensive depth-reduction (Note)
G. Schnitger
Theoretical Computer Science
18
, 1982, pp. 89-93