| Publication | Date of Publication | Type |
|---|
Finding ultrametric minimum-diameter spanning trees
Theoretical Computer Science | 2026-02-27 | Paper |
Deterministic metric 1-median selection with very few queries
Theoretical Computer Science | 2024-08-21 | Paper |
Approximating all-points furthest pairs and maximum spanning trees in metric spaces
International Journal of Foundations of Computer Science | 2024-07-09 | Paper |
| Deterministic metric 1-median selection with A 1-o(1) fraction of points ignored | 2023-03-30 | Paper |
On random perfect matchings in metric spaces with not-too-large diameters
Theory of Computing Systems | 2022-07-26 | Paper |
On ultrametric 1-median selection
Theoretical Computer Science | 2020-05-26 | Paper |
Metric 1-median selection: query complexity vs. approximation ratio
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
On Las Vegas approximations for metric 1-median selection
Information Processing Letters | 2019-04-26 | Paper |
A lower bound for metric 1-median selection
Journal of Computer and System Sciences | 2016-11-14 | Paper |
Metric 1-median selection: query complexity vs. approximation ratio
Lecture Notes in Computer Science | 2016-09-02 | Paper |
Triggering cascades on strongly connected directed graphs
Theoretical Computer Science | 2015-10-08 | Paper |
A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection
Theoretical Computer Science | 2015-09-25 | Paper |
Hardness of learning loops, monoids, and semirings
Discrete Applied Mathematics | 2014-09-12 | Paper |
Deterministic sublinear-time approximations for metric 1-median selection
Information Processing Letters | 2013-06-28 | Paper |
On reversible cascades in scale-free and Erdős-Rényi random graphs
Theory of Computing Systems | 2013-04-15 | Paper |
Triggering cascades on undirected connected graphs
Information Processing Letters | 2013-04-04 | Paper |
Bounding the sizes of dynamic monopolies and convergent sets for threshold-based cascades
Theoretical Computer Science | 2013-02-19 | Paper |
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science | 2012-05-30 | Paper |
Stable sets of threshold-based cascades on the Erdős-Rényi random graphs
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Spreading of messages in random graphs
Theory of Computing Systems | 2011-03-30 | Paper |
Sets of K-independent strings
International Journal of Foundations of Computer Science | 2010-06-18 | Paper |
Bounding the number of tolerable faults in majority-based systems
Lecture Notes in Computer Science | 2010-05-28 | Paper |
Optimal bounds on finding fixed points of contraction mappings
Theoretical Computer Science | 2010-04-15 | Paper |
Efficient testing of forecasts
International Journal of Foundations of Computer Science | 2010-03-09 | Paper |
Spreading messages
Theoretical Computer Science | 2009-07-10 | Paper |
TESTING EMBEDDABILITY BETWEEN METRIC SPACES
International Journal of Foundations of Computer Science | 2009-06-23 | Paper |
Efficient Testing of Forecasts
Lecture Notes in Computer Science | 2009-03-06 | Paper |
The complexity of Tarski's fixed point theorem
Theoretical Computer Science | 2008-07-31 | Paper |
Spreading Messages
Lecture Notes in Computer Science | 2008-07-10 | Paper |
