( en | de | ru )

 

Disambiguation of "Waack, Stephan"

Author of the publication

copydeleteadd this publication to your clipboard
The "Log Rank" Conjecture for Modular Communication Complexity

, and . Electron. Colloquium Comput. Complex., (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stephan Waack

Stephan Waack

Matthias Waack

Karl-Friedrich Waack

Inara Waack

 

Other publications of authors with the same name

Upper and Lower Bounds for Certain Graph-Accessability-Problems on Bounded Alternating (omega)-Branching Programs, and . Universität Trier, Mathematik/Informatik, Forschungsbericht, (1992)Monitoring Software Quality by Means of Simulation Methods., , , , and . ESEM, page 11:1-11:6. ACM, (2016)A Novel Sequence-Based Feature for the Identification of DNA-Binding Sites in Proteins Using Jensen-Shannon Divergence., , , , and . Entropy, 18 (10): 379 (2016)The Möbius Function, Variations Ranks, and Theta(n)-Bounds on the Modular Communication Complexity of the Undirected Graph Connectivity Problem, and . Electron. Colloquium Comput. Complex., (1994)On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams.. STACS, volume 1200 of Lecture Notes in Computer Science, page 201-212. Springer, (1997)Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering., and . STACS, volume 1373 of Lecture Notes in Computer Science, page 227-237. Springer, (1998)Lower Bounds for the Modular Communication Complexity of Various Graph Accessibility Problems., and . LATIN, volume 911 of Lecture Notes in Computer Science, page 427-435. Springer, (1995)Coupled Mutation Finder: A new entropy-based method quantifying phylogenetic noise for the detection of compensatory mutations., , , and . BMC Bioinform., (2012)On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams.. Inf. Comput., 166 (1): 61-70 (2001)Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems, and . Electron. Colloquium Comput. Complex., (1995)