Searching for authors named "Stephan Waack" – sorted by Relevance.
17 documents found, showing 1 through 10.
Next 10 →
-
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams
- …On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams Stephan Waack…
- Cited by 21 (0 self) – Add To MetaCart
-
Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs
- … Meinel 1 and Stephan Waack 2 1 FB IV - Informatik, Universitat Trier D-54286 Trier meinel…
- Cited by 5 (0 self) – Add To MetaCart
-
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
- ….uni-dortmund.de Stephan Waack Institut für Numerische und Angewandte Mathematik Georg-August-Universität Göttingen…
- Cited by 4 (2 self) – Add To MetaCart
-
The "Log Rank" Conjecture for Modular Communication Complexity
- …The "log Rank" Conjecture for Modular Communication Complexity ? Christoph Meinel 1 and Stephan…
- Cited by 1 (0 self) – Add To MetaCart
-
Gene prediction with a hidden Markov model and a new intron submodel
- …Gene Prediction with a Hidden Markov Model and a new Intron Submodel Mario Stanke ∗ and Stephan…
- Cited by 24 (2 self) – Add To MetaCart
-
Realizing Arithmetic Operations in Rings Z[alpha], where is an Algebraic Integer, by Depth-Efficient Threshold Circuits
- …--Efficient Threshold Circuits Stefan Lucks and Stephan Waack Institut fur Numerische und Angewandte Mathematik Georg…
- Add To MetaCart
-
Graph Driven Free Parity-BDDs: Algorithms and Lower Bounds
- … ? , and Stephan Waack ?? Institut fur Numerische und Angewandte Mathematik Georg{August{Universitat G…
- Add To MetaCart
-
Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems
- … ? Christoph Meinel Theoretische Informatik Fachbereich IV Universitat Trier D--54286 Trier Stephan Waack Inst…
- Cited by 2 (0 self) – Add To MetaCart
-
Upper and lower bounds for certain GRAPH-ACCESSIBILITY-PROBLEMs on bounded alternating omega-BRANCHING PROGRAMs
- … Stephan Waack Karl-Weierstra-Institut fur Mathematik D-1086 Berlin, PF 1304 Abstract In the following we…
- Cited by 7 (0 self) – Add To MetaCart
-
The "Log Rank" Conjecture for Modular Communication Complexity
- … Universitat Trier D--54286 Trier Stephan Waack Institut fur Numerische und Angewandte Mathematik Georg…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
