| Publication | Date of Publication | Type |
|---|
Random sources in private computation
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
scientific article; zbMATH DE number 7559107 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Sublinear Random Access Generators for Preferential Attachment Graphs
ACM Transactions on Algorithms | 2022-02-22 | Paper |
Online budgeted maximum coverage
Algorithmica | 2021-09-02 | Paper |
Lower and upper bounds on the randomness complexity of private computations of AND
SIAM Journal on Discrete Mathematics | 2021-03-30 | Paper |
Sublinear Random Access Generators for Preferential Attachment Graphs.
(available as arXiv preprint) | 2020-05-27 | Paper |
Paid exchanges are worth the price
Theoretical Computer Science | 2020-05-23 | Paper |
| Lower and upper bounds on the randomness complexity of private computations of AND | 2020-04-30 | Paper |
Multi-Party Protocols, Information Complexity and Privacy
ACM Transactions on Computation Theory | 2019-12-16 | Paper |
Online bin packing with advice of small size
Theory of Computing Systems | 2019-09-05 | Paper |
Space-constrained interval selection
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Semi-streaming set cover
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Approximating semi-matchings in streaming and in two-party communication
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Reordering buffer management with advice
Journal of Scheduling | 2018-04-04 | Paper |
Multi-party protocols, information complexity and privacy
(available as arXiv preprint) | 2018-03-21 | Paper |
| Online budgeted maximum coverage | 2018-03-02 | Paper |
A Constant Approximation Algorithm for Scheduling Packets on Line Networks
(available as arXiv preprint) | 2018-03-02 | Paper |
Clique here: on the distributed complexity in fully-connected networks
Parallel Processing Letters | 2017-12-15 | Paper |
On-line competitive algorithms for call admission in optical networks
Algorithms — ESA '96 | 2017-12-05 | Paper |
On the additive constant of the k-server work function algorithm
Information Processing Letters | 2017-11-03 | Paper |
Randomness vs. fault-tolerance
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
The slide mechanism with applications in dynamic networks (extended abstract)
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
| Paid exchanges are worth the price | 2017-01-24 | Paper |
A theorem on sensitivity and applications in private computation
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Unconditionally secure computation with reduced interaction
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Shrinking maxima, decreasing costs: new online packing and covering problems
Algorithmica | 2016-05-31 | Paper |
Amortizing randomness in private multiparty computations
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
Online bin packing with advice of small size
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Online algorithms with advice for bin packing and scheduling problems
Theoretical Computer Science | 2015-09-16 | Paper |
On online algorithms with advice for the k-server problem
Theory of Computing Systems | 2015-05-12 | Paper |
Competitive weighted throughput analysis of greedy protocols on DAGs
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Competitive weighted throughput analysis of greedy protocols on dags
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Distributed online call control on general networks | 2014-10-13 | Paper |
Rate vs. buffer size -- greedy information gathering on the line
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Reordering buffer management with advice
Approximation and Online Algorithms | 2014-09-02 | Paper |
Semi-streaming set cover (extended abstract)
Automata, Languages, and Programming | 2014-07-01 | Paper |
Distributed approximate matching
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Shrinking maxima, decreasing costs: new online packing and covering problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Space-constrained interval selection
Automata, Languages, and Programming | 2013-08-12 | Paper |
Approximating semi-matchings in streaming and in two-party communication
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Approximation algorithms for time-constrained scheduling on line networks
Theory of Computing Systems | 2012-12-10 | Paper |
On online algorithms with advice for the \(k\)-server problem
Approximation and Online Algorithms | 2012-07-16 | Paper |
Connectivity guarantees for wireless networks with directional antennas
Computational Geometry | 2011-12-28 | Paper |
Online computation with advice
Theoretical Computer Science | 2011-06-07 | Paper |
Online time-constrained scheduling in linear and ring networks
Journal of Discrete Algorithms | 2011-01-20 | Paper |
Lower bounds on the amount of randomness in private computation
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
On the additive constant of the \(k\)-server work function algorithm
Approximation and Online Algorithms | 2010-05-11 | Paper |
Distributed approximate matching
SIAM Journal on Computing | 2010-04-29 | Paper |
Online Computation with Advice
Automata, Languages and Programming | 2009-07-14 | Paper |
On delivery times in packet networks under adversarial traffic
Theory of Computing Systems | 2007-01-25 | Paper |
Scheduling policies for CIOQ switches
Journal of Algorithms | 2006-08-14 | Paper |
$\Omega(\log n)$ Lower Bounds on the Amount of Randomness in 2-Private Computation
SIAM Journal on Computing | 2005-09-16 | Paper |
Competitive queue policies for differentiated services
Journal of Algorithms | 2005-06-30 | Paper |
Tight bounds for the performance of Longest In System on DAGs
Journal of Algorithms | 2005-06-30 | Paper |
New Stability Results for Adversarial Queuing
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2102767 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2086376 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079411 (Why is no real title available?) | 2004-07-28 | Paper |
Amortizing Randomness in Private Multiparty Computations
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Time-constrained scheduling of weighted packets on trees and meshes
Algorithmica | 2003-08-17 | Paper |
A note on models for non-probabilistic analysis of packet switching networks.
Information Processing Letters | 2003-01-21 | Paper |
A Theorem on Sensitivity and Applications in Private Computation
SIAM Journal on Computing | 2002-09-29 | Paper |
| scientific article; zbMATH DE number 1775421 (Why is no real title available?) | 2002-09-17 | Paper |
On-line competitive algorithms for call admission in optical networks
Algorithmica | 2001-10-14 | Paper |
On-line randomized call control revisited
SIAM Journal on Computing | 2001-06-21 | Paper |
Adaptive packet routing for bursty adversarial traffic
Journal of Computer and System Sciences | 2000-08-27 | Paper |
Randomness versus fault-tolerance
Journal of Cryptology | 2000-05-08 | Paper |
| scientific article; zbMATH DE number 1306872 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1406796 (Why is no real title available?) | 2000-03-01 | Paper |
On capital investment.
Algorithmica | 2000-01-04 | Paper |
| scientific article; zbMATH DE number 1256773 (Why is no real title available?) | 1999-10-04 | Paper |
Characterizing linear size circuits in terms of privacy
Journal of Computer and System Sciences | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1303572 (Why is no real title available?) | 1999-07-08 | Paper |
| scientific article; zbMATH DE number 1263232 (Why is no real title available?) | 1999-06-29 | Paper |
| scientific article; zbMATH DE number 1256671 (Why is no real title available?) | 1999-04-22 | Paper |
Log-Space Polynomial End-to-End Communication
SIAM Journal on Computing | 1998-09-21 | Paper |
A Randomness-Rounds Tradeoff in Private Computation
SIAM Journal on Discrete Mathematics | 1998-05-11 | Paper |
The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms
Journal of Algorithms | 1997-11-18 | Paper |
| scientific article; zbMATH DE number 1003262 (Why is no real title available?) | 1997-04-23 | Paper |
Slide—The Key to Polynomial End-to-End Communication
Journal of Algorithms | 1997-03-18 | Paper |
| scientific article; zbMATH DE number 871902 (Why is no real title available?) | 1996-10-21 | Paper |
