The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bernd Borchert: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bernd Borchert
    Predicate Classes and Promise Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:235-241 [Conf]
  2. Bernd Borchert, Riccardo Silvestri
    The General Notion of a Dot-Operator. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:36-44 [Conf]
  3. Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
    The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:89-101 [Conf]
  4. Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
    Restrictive Acceptance Suffices for Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:124-135 [Conf]
  5. Bernd Borchert, Dietrich Kuske, Frank Stephan
    On Existentially First-Order Definable Languages and Their Relation to NP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:17-28 [Conf]
  6. Bernd Borchert, Frank Stephan
    Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1997, pp:114-127 [Conf]
  7. Bernd Borchert, Klaus Reinhardt
    Searching Paths of Constant Bandwidth. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:187-196 [Conf]
  8. Bernd Borchert
    On the Acceptance Power of Regular Languages. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:533-541 [Conf]
  9. Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
    Restrictive Acceptance Suffices for Equivalence Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  10. Bernd Borchert, Antoni Lozano
    Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:6, pp:- [Journal]
  11. Bernd Borchert, Desh Ranjan, Frank Stephan
    On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:33, pp:- [Journal]
  12. Bernd Borchert, Dietrich Kuske, Frank Stephan
    On Existentially First-Order Definable Languages and their Relation to NP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:13, pp:- [Journal]
  13. Bernd Borchert, Klaus-Jörn Lange, Frank Stephan, Pascal Tesson, Denis Thérien
    The dot-depth and the polynomial hierarchies correspond on the delta levels. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:625-644 [Journal]
  14. Bernd Borchert, Antoni Lozano
    Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:4, pp:211-215 [Journal]
  15. Bernd Borchert, Riccardo Silvestri
    A Characterization of the Leaf Language Classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:3, pp:153-158 [Journal]
  16. Bernd Borchert, Dietrich Kuske, Frank Stephan
    On existentially first-order definable languages and their relation to NP. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:3, pp:259-270 [Journal]
  17. Bernd Borchert, Frank Stephan
    Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:489-504 [Journal]
  18. Bernd Borchert, Desh Ranjan, Frank Stephan
    On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:6, pp:679-693 [Journal]
  19. Bernd Borchert
    On the Acceptance Power of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:2, pp:207-225 [Journal]
  20. Bernd Borchert, Riccardo Silvestri
    Dot operators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:501-523 [Journal]

  21. Few Product Gates But Many Zeros. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002