| Publication | Date of Publication | Type |
|---|
Design and analysis of bipartite experiments under a linear exposure-response model
Electronic Journal of Statistics | 2023-02-06 | Paper |
Design and analysis of bipartite experiments under a linear exposure-response model
Electronic Journal of Statistics | 2023-02-06 | Paper |
Design and Analysis of Bipartite Experiments under a Linear Exposure-Response Model
(available as arXiv preprint) | 2021-03-10 | Paper |
Random road networks: the quadtree model
2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
Approximating \(k\)-center in planar graphs
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
scientific article; zbMATH DE number 7053305 (Why is no real title available?)
(available as arXiv preprint) | 2019-05-10 | Paper |
| scientific article; zbMATH DE number 7053305 (Why is no real title available?) | 2019-05-10 | Paper |
Time-space trade-offs in population protocols
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Stably computable predicates are semilinear
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Facility location in evolving metrics
Automata, Languages, and Programming | 2014-07-01 | Paper |
Effective storage capacity of labeled graphs
Information and Computation | 2014-02-11 | Paper |
A simple population protocol for fast robust approximate majority
Distributed Computing | 2013-07-04 | Paper |
Fast computation by population protocols with a leader
Distributed Computing | 2013-06-28 | Paper |
The computational power of population protocols
Distributed Computing | 2013-06-20 | Paper |
Low-contention data structures
Journal of Parallel and Distributed Computing | 2012-07-13 | Paper |
Learning acyclic probabilistic circuits using test paths
Journal of Machine Learning Research (JMLR) | 2012-04-17 | Paper |
Lower bounds on learning random structures with statistical queries
Lecture Notes in Computer Science | 2010-10-01 | Paper |
\(k\)-Fold unions of low-dimensional concept classes
Information Processing Letters | 2010-09-02 | Paper |
The VC dimension of \(k\)-fold union
Information Processing Letters | 2010-01-29 | Paper |
Combinatorial Properties of a Rooted Graph Polynomial
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
Fast Computation by Population Protocols with a Leader
Lecture Notes in Computer Science | 2008-09-09 | Paper |
A Simple Population Protocol for Fast Robust Approximate Majority
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Expected rank and randomness in rooted graphs
Discrete Applied Mathematics | 2008-03-18 | Paper |
Non-isomorphic caterpillars with identical subtree data
Discrete Mathematics | 2006-06-30 | Paper |
