( en | de | ru )

 

Disambiguation of "Waack, Stephan"

Author of the publication

copydeleteadd this publication to your clipboard
Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs.

, and . MFCS, volume 520 of Lecture Notes in Computer Science, page 337-345. Springer, (1991)

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

Karin 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)A Novel Sequence-Based Feature for the Identification of DNA-Binding Sites in Proteins Using Jensen-Shannon Divergence., , , , and . Entropy, 18 (10): 379 (2016)Monitoring Software Quality by Means of Simulation Methods., , , , and . ESEM, page 11:1-11:6. ACM, (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)Tape Complexity of Word Problems.. FCT, volume 117 of Lecture Notes in Computer Science, page 467-471. Springer, (1981)Investigation and prediction of open source software evolution using automated parameter mining for agent-based simulation., , , and . Autom. Softw. Eng., 28 (1): 3 (2021)On the Halting Problem for Automata in Cones., and . Elektronische Informationsverarbeitung und Kybernetik, 18 (9): 489-499 (1982)Upper and Lower Bounds for Certain Graph Accessibility Problems on Bounded Alternating omega-Branching Programs., and . Complexity Theory: Current Research, page 273-290. Cambridge University Press, (1992)Interpretable Multiclass Models for Corporate Credit Rating Capable of Expressing Doubt., and . Frontiers Appl. Math. Stat., (2016)The "Log Rank" Conjecture for Modular Communication Complexity, and . Electron. Colloquium Comput. Complex., (1996)