| Publication | Date of Publication | Type |
|---|
The support of open versus closed random walks
| 2024-11-14 | Paper |
Fully-dynamic graph sparsifiers against an adaptive adversary
| 2024-06-24 | Paper |
scientific article; zbMATH DE number 7651209 (Why is no real title available?)
| 2023-02-07 | Paper |
Hermitian Laplacians and a Cheeger Inequality for the Max-2-Lin Problem
| 2022-05-11 | Paper |
Balls into bins via local search
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Constructing linear-sized spectral sparsification in almost-linear time
SIAM Journal on Computing | 2018-12-19 | Paper |
Solving Lyapunov equation by quantum algorithm
Control Theory and Technology | 2018-07-18 | Paper |
Minimum Manhattan network is NP-complete
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Gossip vs. Markov chains, and randomness-efficient rumor spreading
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Randomized rumour spreading: the effect of the network topology
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Multiproduct price optimization under the multilevel nested logit model
Annals of Operations Research | 2017-08-25 | Paper |
An SDP-based algorithm for linear-sized spectral sparsification
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Partitioning well-clustered graphs: spectral clustering works!
SIAM Journal on Computing | 2017-05-30 | Paper |
Balls into bins via local search: cover time and maximum load
| 2017-03-03 | Paper |
Balls into bins via local search: cover time and maximum load
Random Structures \& Algorithms | 2016-07-25 | Paper |
Soliton interactions of the ``good Boussinesq equation on a nonzero background
Communications in Theoretical Physics | 2015-11-18 | Paper |
Choice-based recommender systems: a unified approach to achieving relevancy and diversity
Operations Research | 2015-09-11 | Paper |
Dirichlet eigenvalues, local random walks, and analyzing clusters in graphs
Algorithms and Computation | 2015-09-11 | Paper |
Deterministic polynomial-time algorithms for designing short DNA words
Theoretical Computer Science | 2014-01-10 | Paper |
Counting Hypergraphs in Data Streams
| 2013-04-28 | Paper |
Counting arbitrary subgraphs in data streams
Automata, Languages, and Programming | 2012-11-01 | Paper |
Low randomness rumor spreading via hashing
| 2012-08-23 | Paper |
Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies
| 2012-01-12 | Paper |
Approximate counting of cycles in streams
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Greedy construction of 2-approximate minimum Manhattan networks
International Journal of Computational Geometry & Applications | 2011-08-23 | Paper |
Minimum Manhattan network is NP-complete
Discrete \& Computational Geometry | 2011-06-03 | Paper |
Deterministic polynomial-time algorithms for designing short DNA words
Lecture Notes in Computer Science | 2010-06-17 | Paper |
ON CONSTRUCTION OF ALMOST-RAMANUJAN GRAPHS
Discrete Mathematics, Algorithms and Applications | 2009-09-22 | Paper |
On Construction of Almost-Ramanujan Graphs
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Two improved range-efficient algorithms for \(F_0\) estimation
Theoretical Computer Science | 2009-03-20 | Paper |
Greedy Construction of 2-Approximation Minimum Manhattan Network
Algorithms and Computation | 2009-01-29 | Paper |
THE SZNAJD MODEL WITH TEAM WORK
International Journal of Modern Physics C | 2008-10-17 | Paper |
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Two Improved Range-Efficient Algorithms for F 0 Estimation
Lecture Notes in Computer Science | 2007-11-13 | Paper |
