Paul Balister - RankMe

43 papers A* 4B 1Journal 37Unranked 1

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