- UNAMBIGUOUS COMPUTATION: BOOLEAN HIERARCHIES AND SPARSE TURING-COMPLETE SETS
- Complexity of Certificates, Heuristics, and Counting Types, with Applications to
- DOI: 10.1007/s00224-004-1209-8 Theory Comput. Systems 39, 635668 (2006)
- Theoretical Informatics and Applications Will be set by the publisher Informatique Theorique et Applications
- Information Processing Letters 87 (2003) 712 www.elsevier.com/locate/ipl
- DOI: 10.1007/s00224-002-1093-z Theory Comput. Systems 36, 375386 (2003)
- Some Facets of Complexity Theory and Cryptography: A Five-Lecture Tutorial
- DOI: 10.1007/s00224-001-1048-9 Theory Comput. Systems 35, 8193 (2002)
- Journal of Computer and System Sciences 58, 648 659 (1999) Creating Strong, Total, Commutative, Associative
- Gerd Wechsung: Die spaten Jahre 1990 bis 2004 (Verfat von Harald Hempel und Jorg Rothe)
- Komplexitat von Zertifikaten, Heuristiken und Zahltypen mit Anwendungen in der
- Kryptographische Protokolle und Null-Information Jorg Rothe
- Information and Computation 158, 29 52 (2000) Tally NP Sets and Easy Census Functions
- Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System Is Complete for Parallel Access
- On Some Promise Classes in Structural Complexity Theory
