Erweiterte Suche
Zurück zur Übersicht
Exportieren als [feed] RSS 1.0 [feed] RSS 2.0

Zitation

Gruppieren nach: Dokumenttyp | Erscheinungsjahr | Keine Sortierung
Springe zu: Zeitschriftenartikel | Konferenzveröffentlichung | Arbeitspapier
Anzahl der Einträge: 14.

Zeitschriftenartikel

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (2004) On relations between counting communication complexity classes. Journal of Computer and System Sciences : JCSS San Diego, CA [u.a.] 69 2 259-280 [Zeitschriftenartikel]

Krause, Matthias ; Waack, Stephan (1995) Variation ranks of communication matrices and lower bounds for depth-two circuits having nearly symmetric gates with unbounded fan-in. Mathematical Systems Theory New York, NY [u.a.] 28 6 553-564 [Zeitschriftenartikel]

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1994) Separating oblivious linear length MODp-branching program classes. Journal of Information Processing and Cybernetics Giessen 30 2 63-75 [Zeitschriftenartikel]

Hromkovič, Juraj ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1992) Branching programs provide lower bounds on the areas of multilective deterministic and nondeterministic VLSI-circuits. Information and Computation Amsterdam [u.a.] 96 2 168-178 [Zeitschriftenartikel]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1992) Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. RAIRO. Theoretical Informatics and Applications Les Ulis 26 4 345-362 [Zeitschriftenartikel]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1991) Separating the eraser Turing machine classes Le, NLe, co-NLe and Pe. Theoretical Computer Science Amsterdam [u.a.] 86 2 267-275 [Zeitschriftenartikel]

Krause, Matthias ; Waack, Stephan (1991) On oblivious branching programs of linear length. Information and Computation Amsterdam [u.a.] 94 2 232-249 [Zeitschriftenartikel]

Konferenzveröffentlichung

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating counting communication complexity classes. Finkel, Alain ; Jantzen, Matthias Lecture Notes in Computer Science 577 279-292 In: STACS 92 : 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13 - 15, 1992, proceedings (1992) Berlin [u.a.] STACS 92 (Cachan, France) [Konferenzveröffentlichung]

Krause, Matthias ; Waack, Stephan Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in. Sipser, Michael 1 777-782 In: 32nd Annual Symposium on Foundations of Computer Science : San Juan, Puerto Rico, October 1 - 4, 1991, proceedings (1991) Los Alamitos, CA [u.a.] FOCS 1991 (San Juan, Puerto Rico) [Konferenzveröffentlichung]

Krause, Matthias ; Waack, Stephan On oblivious branching programs of linear length. Csirik, János ; Demetrovics, János ; Gécseg, Ferenc Lecture Notes in Computer Science 380 287-296 In: Fundamentals of computation theory : International Conference FCT '89, Szeged, Hungary, August 21 - 25, 1989, proceedings (1989) Berlin [u.a.] FCT '89 (Szeged, Hungary) [Konferenzveröffentlichung]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating complexity classes related to restricted logarithmic space-bounded Turing machines. Ritter, Gerhard X. IFIP congress series 11 287-292 In: Information Processing 89 : Proceedings of the IFIP 11th World Computer Congress, San Francisco, U.S.A., August 28 - September 1, 1989 (1989) Amsterdam [u.a.] IFIP '89 (San Francisco, CA) [Konferenzveröffentlichung]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines. Young, Paul 240-249 In: Structure in complexity theory : Fourth Annual Conference, June 19 - 22, 1989, University of Oregon, Eugene, Oregon, proceedings (1989) Washington, DC [u.a.] 4th Annual Conference on Structure in Complexity Theory (Eugene, OR) [Konferenzveröffentlichung]

Krause, Matthias ; Meinel, Christoph ; Waack, Stephan Separating the eraser turing machine classes Le, NLe, co-NLe and Pe. Chytil, Michal P. ; Janiga, Ladislav ; Koubek, Václav Lecture Notes in Computer Science 324 405-413 In: Mathematical Foundations of Computer Science 1988 : proceedings of the 13th Symposium, Carlsbad, Czechoslovakia, August 29 – September 2, 1988 (1988) Berlin [u.a.] MFCS '88 (Carlsbad, Czechoslovakia) [Konferenzveröffentlichung]

Arbeitspapier

Damm, Carsten ; Krause, Matthias ; Meinel, Christoph ; Waack, Stephan (1992) Separating counting communication complexity classes. Forschungsbericht / Universität Trier, Mathematik, Informatik Trier 92-01 [Arbeitspapier]

Diese Liste wurde am Tue Dec 3 01:10:45 2024 CET automatisch erstellt.