Bernd Borchert

According to our database1, Bernd Borchert authored at least 25 papers between 1994 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2013
Few Product Gates but Many Zeroes.
Chicago J. Theor. Comput. Sci., 2013

Online Banking with NFC-Enabled Bank Card and NFC-Enabled Smartphone.
Proceedings of the Information Security Theory and Practice. Security of Mobile and Cyber-Physical Systems, 2013

Indirect NFC-login.
Proceedings of the 8th International Conference for Internet Technology and Secured Transactions, 2013

2009
Few Product Gates But Many Zeros.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008
Formal Language Characterizations of P, NP, and PSPACE.
Journal of Automata, Languages and Combinatorics, 2008

2007
Deterministically and Sudoku-Deterministically Recognizable Picture Languages.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006
Searching Paths of Constant Bandwidth.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

2005
The dot-depth and the polynomial hierarchies correspond on the delta levels.
Int. J. Found. Comput. Sci., 2005

2004
The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels.
Proceedings of the Developments in Language Theory, 2004

2001
Dot operators.
Theor. Comput. Sci., 2001

1999
Restrictive Acceptance Suffices for Equivalence Problems.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions.
Theory Comput. Syst., 1998

On Existentially First-Order Definable Languages and Their Relation to NP.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
A Characterization of the Leaf Language Classes.
Inf. Process. Lett., 1997

On Existentially First-Order Definable Languages and their Relation to NP
Electronic Colloquium on Computational Complexity (ECCC), 1997

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory.
Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

The General Notion of a Dot-Operator.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996
Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept.
Inf. Process. Lett., 1996

Looking for an Analogue of Rice's Theorem in Complexity Theory
Electronic Colloquium on Computational Complexity (ECCC), 1996

Powers-of-Two Acceptance Suffices for Equivalence and Bounded Ambiguity Problems
Electronic Colloquium on Computational Complexity (ECCC), 1996

On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions
Electronic Colloquium on Computational Complexity (ECCC), 1996

Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept
Electronic Colloquium on Computational Complexity (ECCC), 1996

1994
On the Acceptance Power of Regular Languages.
Proceedings of the STACS 94, 1994

Predicate Classes and Promise Classes.
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

Predicate classes, promise classe, and the acceptance power of regular languages.
PhD thesis, 1994


  Loading...