Beate Bollig

1.1k total citations
33 papers, 518 citations indexed

About

Beate Bollig is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Hardware and Architecture. According to data from OpenAlex, Beate Bollig has authored 33 papers receiving a total of 518 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Computational Theory and Mathematics, 18 papers in Artificial Intelligence and 6 papers in Hardware and Architecture. Recurrent topics in Beate Bollig's work include Formal Methods in Verification (22 papers), Machine Learning and Algorithms (10 papers) and Complexity and Algorithms in Graphs (10 papers). Beate Bollig is often cited by papers focused on Formal Methods in Verification (22 papers), Machine Learning and Algorithms (10 papers) and Complexity and Algorithms in Graphs (10 papers). Beate Bollig collaborates with scholars based in Germany, Czechia and Switzerland. Beate Bollig's co-authors include Ingo Wegener, Philipp Woelfel, Detlef Sieling, John Hooker, Alasdair Urquhart, John Franco, Martin Anthony, Jehoshua Bruck, Claude Carlet and Robert H. Sloan and has published in prestigious journals such as IEEE Transactions on Computers, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Beate Bollig

28 papers receiving 466 citations

Peers

Countries citing papers authored by Beate Bollig

Since Specialization

Citations

This map shows the geographic impact of Beate Bollig's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Beate Bollig with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Beate Bollig more than expected).

Fields of papers citing papers by Beate Bollig

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Beate Bollig. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Beate Bollig. The network helps show where Beate Bollig may publish in the future.

Co-authorship network of co-authors of Beate Bollig

This figure shows the co-authorship network connecting the top 25 collaborators of Beate Bollig. A scholar is included among the top collaborators of Beate Bollig based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Beate Bollig. Beate Bollig is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Implicit computation of maximum bipartite matchings by sublinear functional operations 2014 ·Theoretical Computer Science ·Beate Bollig, (unknown), (unknown)	1
2	A simpler counterexample to a long-standing conjecture on the complexity of Bryantʼs apply algorithm 2013 ·Information Processing Letters ·Beate Bollig	1
3	On symbolic OBDD-based algorithms for the minimum spanning tree problem 2011 ·Theoretical Computer Science ·Beate Bollig	7
4	Exponential space complexity for OBDD-based reachability analysis 2010 ·Information Processing Letters ·Beate Bollig	6
5	On the OBDD complexity of the most significant bit of integer multiplication 2010 ·Theoretical Computer Science ·Beate Bollig	3
6	Boolean Models and Methods in Mathematics, Computer Science, and Engineering 2010 ·Cambridge University Press eBooks ·Yves Crama, Reinhard Pöschel, Jan C. Bioch, Alasdair Urquhart, John Franco, John Hooker, Martin Anthony, Robert H. Sloan, Claude Carlet, Beate Bollig, Matthias Krause, Jehoshua Bruck, (unknown), Tiziano Villa, Charles J. Colbourn	65
7	Integer Multiplicaton and the Complexity of Binary Decision Diagrams. 2009 ·Bulletin of the European Association for Theoretical Computer Science ·Beate Bollig	1
8	On the size of (generalized) OBDDs for threshold functions 2009 ·Information Processing Letters ·Beate Bollig	2
9	A note on the size of OBDDs for the graph of integer multiplication 2008 ·Information Processing Letters ·Beate Bollig	1
10	A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications 2004 ·Theory of Computing Systems ·Beate Bollig, Philipp Woelfel	2
11	On the non-approximability of Boolean functions by OBDDs and read-k-times branching programs 2002 ·Beate Bollig, (unknown), Ingo Wegener	1
12	Approximability and Nonapproximability by Binary Decision Diagrams 2000 ·Electronic colloquium on computational complexity ·Beate Bollig, Ingo Wegener	1
13	Complexity Theoretical Results on Partitioned (Nondeterministic) Binary Decision Diagrams 1999 ·Theory of Computing Systems ·Beate Bollig, Ingo Wegener	10
14	Hierarchy theorems for kOBDDs and kIBDDs 1998 ·Theoretical Computer Science ·Beate Bollig, (unknown), Detlef Sieling, Ingo Wegener	13
15	Completeness and Non-Completeness Results with Respect to Read-Once Projections 1998 ·Information and Computation ·Beate Bollig, Ingo Wegener	1
16	A very simple function that requires exponential size read-once branching programs 1998 ·Information Processing Letters ·Beate Bollig, Ingo Wegener	13
17	Read-once projections and formal circuit verification with binary decision diagrams 1996 ·Lecture notes in computer science ·Beate Bollig, Ingo Wegener	1
18	On the effect of local changes in the variable ordering of ordered decision diagrams 1996 ·Information Processing Letters ·Beate Bollig, (unknown), Ingo Wegener	23
19	ON THE AVERAGE CASE CIRCUIT DELAY OF DISJUNCTION 1995 ·Parallel Processing Letters ·Beate Bollig, (unknown), (unknown), Petr Savický	1
20	On the Power of Different Types of Restricted Branching Programs 1994 ·Electronic colloquium on computational complexity ·Beate Bollig, (unknown), Detlef Sieling, Ingo Wegener	5

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact