The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Beate Bollig: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Beate Bollig, Martin Sauerhoff, Ingo Wegener
    On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:172-183 [Conf]
  2. Beate Bollig
    Property Testing and the Branching Program Size of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:258-269 [Conf]
  3. Beate Bollig, Ingo Wegener
    Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:187-198 [Conf]
  4. Beate Bollig, Stephan Waack, Philipp Woelfel
    Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:83-94 [Conf]
  5. Beate Bollig
    Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:222-231 [Conf]
  6. Beate Bollig, Philipp Woelfel
    A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:131-142 [Conf]
  7. Beate Bollig, Ingo Wegener
    Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:159-168 [Conf]
  8. Beate Bollig
    Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:295-306 [Conf]
  9. Beate Bollig, Ingo Wegener
    Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:491-502 [Conf]
  10. Beate Bollig, Philipp Woelfel
    A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:419-424 [Conf]
  11. Beate Bollig
    Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:48, pp:- [Journal]
  12. Beate Bollig, Ingo Wegener
    Approximability and Nonapproximability by Binary Decision Diagrams [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:52, pp:- [Journal]
  13. Beate Bollig, Philipp Woelfel, Stephan Waack
    Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:073, pp:- [Journal]
  14. Beate Bollig
    A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:033, pp:- [Journal]
  15. Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
    On the Power of Different Types of Restricted Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:26, pp:- [Journal]
  16. Beate Bollig, Ingo Wegener
    Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:48, pp:- [Journal]
  17. Beate Bollig, Martin Sauerhoff, Ingo Wegener
    On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:263-278 [Journal]
  18. Beate Bollig, Ingo Wegener
    Completeness and Non-Completeness Results with Respect to Read-Once Projections. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:143, n:1, pp:24-33 [Journal]
  19. Beate Bollig
    A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:3, pp:143-148 [Journal]
  20. Beate Bollig
    A large lower bound on the query complexity of a simple boolean function. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:4, pp:423-428 [Journal]
  21. Beate Bollig, Martin Löbbing, Ingo Wegener
    On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:5, pp:233-239 [Journal]
  22. Beate Bollig, Ingo Wegener
    Functions that have read-once branching programs of quadratic size are not necessarily testable. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:1, pp:25-29 [Journal]
  23. Beate Bollig, Ingo Wegener
    A Very Simple Function that Requires Exponential Size Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:2, pp:53-57 [Journal]
  24. Beate Bollig
    Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:2, pp:149-162 [Journal]
  25. Beate Bollig
    Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:1, pp:51-66 [Journal]
  26. Beate Bollig, Martin Löbbing, Martin Sauerhoff, Ingo Wegener
    On the complexity of the hidden weighted bit function for various BDD models. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:2, pp:103-116 [Journal]
  27. Beate Bollig, Ingo Wegener
    Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:3, pp:558-579 [Journal]
  28. Beate Bollig
    Testing Membership in Formal Languages Implicitly Represented by Boolean Functions. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2006, v:12, n:6, pp:710-724 [Journal]
  29. Beate Bollig, Philipp Woelfel
    A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2005, v:38, n:6, pp:671-685 [Journal]
  30. Beate Bollig, Ingo Wegener
    Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:4, pp:487-503 [Journal]
  31. Beate Bollig, Martin Hühne, Stefan Pölt, Petr Savický
    On the Average Case Circuit Delay of Disjunction. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:275-280 [Journal]
  32. Beate Bollig, Ingo Wegener
    Improving the Variable Ordering of OBDDs Is NP-Complete. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:9, pp:993-1002 [Journal]
  33. Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
    Hierarchy Theorems for kOBDDs and kIBDDs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:45-60 [Journal]
  34. Beate Bollig, Stephan Waack, Philipp Woelfel
    Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:86-99 [Journal]

  35. New Results on the Most Significant Bit of Integer Multiplication. [Citation Graph (, )][DBLP]


  36. A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication. [Citation Graph (, )][DBLP]


  37. Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks. [Citation Graph (, )][DBLP]


  38. Exact OBDD Bounds for Some Fundamental Functions. [Citation Graph (, )][DBLP]


  39. On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem. [Citation Graph (, )][DBLP]


  40. Symbolic OBDD-Based Reachability Analysis Needs Exponential Space. [Citation Graph (, )][DBLP]


  41. On the OBDD Complexity of the Most Significant Bit of Integer Multiplication. [Citation Graph (, )][DBLP]


  42. Larger Lower Bounds on the OBDD Complexity of Integer Multiplication. [Citation Graph (, )][DBLP]


  43. On the OBDD complexity of the most significant bit of integer multiplication. [Citation Graph (, )][DBLP]


  44. Exact OBDD Bounds for some Fundamental Functions. [Citation Graph (, )][DBLP]


  45. The Optimal Read-Once Branching Program Complexity for the Direct Storage Access Function. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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