| Publication | Date of Publication | Type |
|---|
Lockless blockchain sharding with multiversion control
Structural Information and Communication Complexity | 2024-01-11 | Paper |
Flexible scheduling of transactional memory on trees
Theoretical Computer Science | 2023-10-12 | Paper |
Load balanced distributed directories
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Flexible scheduling of transactional memory on trees
Lecture Notes in Computer Science | 2023-06-12 | Paper |
Load balanced distributed directories
Information and Computation | 2022-05-17 | Paper |
Dynamic scheduling in distributed transactional memory
Distributed Computing | 2022-04-01 | Paper |
Time-communication impossibility results for distributed transactional memory
Distributed Computing | 2022-02-15 | Paper |
Fast scheduling in distributed transactional memory
Theory of Computing Systems | 2021-06-24 | Paper |
Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
| 2019-11-22 | Paper |
Optimal nearest neighbor queries in sensor networks
Algorithms for Sensor Systems | 2018-10-17 | Paper |
The bursty Steiner tree problem
International Journal of Foundations of Computer Science | 2018-05-14 | Paper |
Distributed queuing in dynamic networks
Parallel Processing Letters | 2017-12-15 | Paper |
Optimal Oblivious Path Selection on the Mesh
IEEE Transactions on Computers | 2017-11-10 | Paper |
A combinatorial treatment of balancing networks
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
Approximating Congestion + Dilation in Networks via "Quality of Routing” Games
IEEE Transactions on Computers | 2017-07-12 | Paper |
An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs
IEEE Transactions on Computers | 2017-07-12 | Paper |
Impossibility results for weak threshold networks
Information Processing Letters | 2016-05-26 | Paper |
Impossibility results for distributed transactional memory
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Efficient transformations for Klee's measure problem in the streaming model
Computational Geometry | 2016-01-15 | Paper |
Optimal nearest neighbor queries in sensor networks
Theoretical Computer Science | 2015-12-11 | Paper |
An analysis framework for distributed hierarchical directories
Algorithmica | 2015-05-26 | Paper |
Sketching asynchronous streams over a sliding window
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Distributed transactional memory for general networks
Distributed Computing | 2015-02-23 | Paper |
Hard-potato routing
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Sparse covers for planar graphs and graphs that exclude a fixed minor
Algorithmica | 2014-07-03 | Paper |
Improved sparse covers for graphs excluding a fixed minor
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Contention-free MAC protocols for asynchronous wireless sensor networks
Distributed Computing | 2013-06-28 | Paper |
Sketching asynchronous data streams over sliding windows
Distributed Computing | 2013-06-20 | Paper |
Window-based greedy contention management for transactional memory: theory and practice
Distributed Computing | 2013-02-04 | Paper |
Stretch in Bottleneck Games
Lecture Notes in Computer Science | 2012-09-25 | Paper |
A competitive analysis for balanced transactional memory workloads
Algorithmica | 2012-04-26 | Paper |
Oblivious routing for sensor network topologies
Monographs in Theoretical Computer Science. An EATCS Series | 2011-04-05 | Paper |
Oblivious buy-at-bulk in planar graphs
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Concurrent counting is harder than queuing
Theoretical Computer Science | 2010-11-11 | Paper |
Bottleneck congestion games with logarithmic price of anarchy
Algorithmic Game Theory | 2010-10-19 | Paper |
Window-based greedy contention management for transactional memory
Lecture Notes in Computer Science | 2010-09-10 | Paper |
An efficient counting network
Theoretical Computer Science | 2010-08-11 | Paper |
scientific article; zbMATH DE number 5605099 (Why is no real title available?)
| 2009-09-19 | Paper |
scientific article; zbMATH DE number 5605056 (Why is no real title available?)
| 2009-09-19 | Paper |
scientific article; zbMATH DE number 5605064 (Why is no real title available?)
| 2009-09-19 | Paper |
Atomic routing games on maximum congestion
Theoretical Computer Science | 2009-08-21 | Paper |
Universal Bufferless Packet Switching
SIAM Journal on Computing | 2008-08-14 | Paper |
Atomic Routing Games on Maximum Congestion
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing | 2007-10-24 | Paper |
A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
STACS 2007 | 2007-09-03 | Paper |
Direct routing: Algorithms and complexity
Algorithmica | 2007-06-21 | Paper |
Analysis of Link Reversal Routing Algorithms
SIAM Journal on Computing | 2006-06-01 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Euro-Par 2004 Parallel Processing
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Contention-Free MAC Protocols for Wireless Sensor Networks
Lecture Notes in Computer Science | 2005-08-17 | Paper |
scientific article; zbMATH DE number 2156276 (Why is no real title available?)
| 2005-04-15 | Paper |
The cost of concurrent, low-contention Read \& Modify \& Write
Theoretical Computer Science | 2005-04-06 | Paper |
\(\widetilde{O}\) (congestion + dilation) hot-potato routing on leveled networks
Theory of Computing Systems | 2005-02-08 | Paper |
scientific article; zbMATH DE number 1962847 (Why is no real title available?)
| 2003-08-11 | Paper |
Sorting and counting networks of arbitrary width and small depth
Theory of Computing Systems | 2002-06-27 | Paper |
Threshold counters with increments and decrements
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1507041 (Why is no real title available?)
| 2001-09-04 | Paper |
Supporting increment and decrement operations in balancing networks
Chicago Journal of Theoretical Computer Science | 2001-05-15 | Paper |
scientific article; zbMATH DE number 1445335 (Why is no real title available?)
| 2000-05-10 | Paper |
A combinatorial treatment of balancing networks
Journal of the ACM | 1998-01-22 | Paper |
scientific article; zbMATH DE number 828718 (Why is no real title available?)
| 1996-11-04 | Paper |
