Paul Balister

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 15

Top Topics

Dense Subgraphs

High Level Abstractions

Top Venues

Random Struct. Algorithms

Comb. Probab. Comput.

J. Comb. Theory, Ser. A

Publications

Paul Balister, Ali Dogan
Path Saturation Game on Six Vertices. Graphs Comb. 40 (3) (2024)
Paul Balister, Béla Bollobás, Robert Morris, Paul Smith
Subcritical monotone cellular automata. Random Struct. Algorithms 64 (1) (2024)
Paul Balister, Emil Powierski, Alex Scott, Jane Tan
Counting partitions of G n , 1 / 2 $$ {G}_{n,1/2} $$ with degree congruence conditions. Random Struct. Algorithms 62 (3) (2023)
Paul Balister, Emil Powierski, Alex D. Scott, Jane Tan
A Note on Infinite Antichain Density. SIAM J. Discret. Math. 36 (1) (2022)
Paul Balister, Stefanie Gerke
The asymptotic number of prefix normal words. Theor. Comput. Sci. 784 (2019)
Paul Balister, Béla Bollobás, Julian Sahasrabudhe, Alexander Veremyev
Dense subgraphs in random graphs. Discret. Appl. Math. 260 (2019)
Paul Balister, Ali Dogan
On the edge spectrum of saturated graphs for paths and stars. J. Graph Theory 89 (4) (2018)
Paul Balister, Hao Li, Richard H. Schelp
Decompositions of graphs into cycles with chords. J. Comb. Theory, Ser. B 128 (2018)
Paul Balister, Béla Bollobás, Jonathan Lee, Bhargav P. Narayanan
Line percolation. Random Struct. Algorithms 52 (4) (2018)
Paul Balister, Béla Bollobás, Imre Leader, Robert Morris
Introduction. Comb. Probab. Comput. 27 (4) (2018)
Paul Balister, Béla Bollobás, Martin Haenggi, Amites Sarkar, Mark Walters
Sentry selection in sensor networks: theory and algorithms. Int. J. Sens. Networks 24 (3) (2017)
Paul Balister, Amy Shaw, Béla Bollobás, Bhargav P. Narayanan
Catching a fast robber on the grid. J. Comb. Theory, Ser. A 152 (2017)
Paul Balister, Béla Bollobás, Amites Sarkar
Barrier Coverage. Random Struct. Algorithms 49 (3) (2016)
Paul Balister, Scott Binski, Béla Bollobás, Bhargav P. Narayanan
Catching a fast robber on the grid. CoRR (2016)
Paul Balister, Béla Bollobás, Karen Gunderson
Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs. Eur. J. Comb. 57 (2016)
Paul Balister
Introduction. Comb. Probab. Comput. 24 (4) (2015)
Paul Balister, Béla Bollobás
Interference percolation. Random Struct. Algorithms 44 (4) (2014)
Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discret. Math. 27 (1) (2013)
Paul Balister, Béla Bollobás
Critical Probabilities of 1-Independent Percolation Models. Comb. Probab. Comput. 21 (1-2) (2012)
Paul Balister, Béla Bollobás
Projections, entropy and sumsets. Comb. 32 (2) (2012)
Phoebus Chen, Karl Henrik Johansson, Paul Balister, Béla Bollobás, Shankar Sastry
Multi-path Routing Metrics for Reliable Wireless Mesh Routing Topologies CoRR (2011)
Paul Balister, Balázs Patkós
Random Partial Orders Defined by Angular Domains. Order 28 (2) (2011)
Paul Balister, Béla Bollobás, Animashree Anandkumar, Alan S. Willsky
Energy-latency tradeoff for in-network function computation in random networks. INFOCOM (2011)
Paul Balister, Béla Bollobás, J. Robert Johnson, Mark Walters
Random majority percolation. Random Struct. Algorithms 36 (3) (2010)
Paul Balister, Steve Kalikow, Amites Sarkar
The Linus Sequence. Comb. Probab. Comput. 19 (1) (2010)
Paul Balister, Santosh Kumar
Random vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors. INFOCOM (2009)
Paul Balister, Stefanie Gerke, Gregory Z. Gutin
Convex Sets in Acyclic Digraphs. Order 26 (1) (2009)
Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun Sinha
Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks. INFOCOM (2009)
Paul Balister, Béla Bollobás, Stefanie Gerke
Sequences with Changing Dependencies. SIAM J. Discret. Math. 22 (3) (2008)
Paul Balister, Béla Bollobás, Stefanie Gerke
Connectivity of addable graph classes. J. Comb. Theory, Ser. B 98 (3) (2008)
Paul Balister, Béla Bollobás, Amites Sarkar, Santosh Kumar
Reliable density estimates for coverage and connectivity in thin strips of finite length. MobiCom (2007)
Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions. Biol. Cybern. 92 (6) (2005)
Paul Balister, Béla Bollobás, Martin Haenggi, Mark Walters
Fast transmission in ad hoc networks. ISIT (2004)
Robert Kozma, Marko Puljic, Paul Balister, Béla Bollobás, Walter J. Freeman
Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics. ACRI (2004)
Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp
Graphs with large maximum degree containing no odd cycles of a given length. J. Comb. Theory, Ser. B 87 (2) (2003)
Paul Balister
Packing Digraphs With Directed Closed Trails. Comb. Probab. Comput. 12 (1) (2003)
Paul Balister, Béla Bollobás, Jonathan Cutler, Luke Pebody
The Interlace Polynomial of Graphs at - 1. Eur. J. Comb. 23 (7) (2002)
Paul Balister
Vertex-distinguishing edge colorings of random graphs. Random Struct. Algorithms 20 (1) (2002)
Paul Balister, Yair Caro, Cecil C. Rousseau, Raphael Yuster
Zero-sum Square Matrices. Eur. J. Comb. 23 (5) (2002)
Paul Balister
Packing Circuits Into KN. Comb. Probab. Comput. 10 (6) (2001)
Paul Balister
On The Alspach Conjecture. Comb. Probab. Comput. 10 (2) (2001)
Paul Balister, Béla Bollobás, Alan Stacey
Counting Boundary Paths for Oriented Percolation Clusters. Random Struct. Algorithms 14 (1) (1999)
Paul Balister, Béla Bollobás, Alan Stacey
Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions. Random Struct. Algorithms 5 (4) (1994)