| Publication | Date of Publication | Type |
|---|
An extendable data structure for incremental stable perfect hashing
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7759279 (Why is no real title available?)
| 2023-11-02 | Paper |
Dynamic dictionaries for multisets and counting filters with constant time operations
Algorithmica | 2023-06-05 | Paper |
Upper tail analysis of bucket sort and random tries
Lecture Notes in Computer Science | 2023-03-22 | Paper |
Optimal distributed covering algorithms
Distributed Computing | 2023-03-14 | Paper |
Three notes on distributed property testing
| 2023-02-03 | Paper |
Optimal distributed covering algorithms
| 2023-02-03 | Paper |
Approximating minimum feedback sets and multi-cuts in directed graphs (extended summary)
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Distributed set cover approximation: primal-dual with optimal locality
| 2022-07-21 | Paper |
Dynamic dictionaries for multisets and counting filters with constant time operations
| 2022-03-25 | Paper |
Sublinear Random Access Generators for Preferential Attachment Graphs
ACM Transactions on Algorithms | 2022-02-22 | Paper |
Upper tail analysis of bucket sort and random tries
Theoretical Computer Science | 2021-11-18 | Paper |
Survivable network design for group connectivity in low-treewidth graphs
| 2021-08-04 | Paper |
Optimal Distributed Covering Algorithms
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Sublinear Random Access Generators for Preferential Attachment Graphs.
| 2020-05-27 | Paper |
On-line path computation and function placement in SDNs
Lecture Notes in Computer Science | 2019-11-22 | Paper |
On-line path computation and function placement in SDNs
Theory of Computing Systems | 2019-06-21 | Paper |
A deterministic distributed 2-approximation for weighted vertex cover in \(O(\log N\log\varDelta/\log^2\log\varDelta)\) rounds
| 2019-01-30 | Paper |
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Best of two local models: centralized local and distributed local algorithms
Information and Computation | 2018-09-27 | Paper |
On the design of IEEE compliant floating point units
IEEE Transactions on Computers | 2018-07-09 | Paper |
Minimal controllability of conjunctive Boolean networks is NP-complete
Automatica | 2018-06-20 | Paper |
Explicit rateless codes for memoryless binary-input output-symmetric channels
Theory of Computing | 2018-06-15 | Paper |
A Constant Approximation Algorithm for Scheduling Packets on Line Networks
| 2018-03-02 | Paper |
Online packet-routing in grids with bounded buffers
Algorithmica | 2017-10-09 | Paper |
LP Decoding of Regular LDPC Codes in Memoryless Channels
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On Decoding Irregular Tanner Codes With Local-Optimality Guarantees
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Observability of Boolean networks: a graph-theoretic approach
Automatica | 2017-06-02 | Paper |
Deterministic rateless codes for BSC
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
An approximation algorithm for path computation and function placement in SDNs
Structural Information and Communication Complexity | 2016-12-01 | Paper |
On network design problems: fixed cost flows and the covering steiner problem
ACM Transactions on Algorithms | 2015-09-02 | Paper |
A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
Theoretical Computer Science | 2015-05-22 | Paper |
Deterministic stateless centralized local algorithms for bounded degree graphs
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Improved approximations of crossings in graph drawings
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Hitting sets online and unique-MAX coloring
Discrete Applied Mathematics | 2014-09-12 | Paper |
Set connectivity problems in undirected graphs and the directed Steiner network problem
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Local-optimality guarantees based on paths for optimal decoding
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Competitive and deterministic embeddings of virtual networks
Theoretical Computer Science | 2014-01-10 | Paper |
A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations
Structural Information and Communication Complexity | 2013-12-17 | Paper |
Online Multi-Commodity Flow with High Demands
Approximation and Online Algorithms | 2013-09-13 | Paper |
A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\)
Information Processing Letters | 2013-04-04 | Paper |
Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks
Annals of Operations Research | 2013-04-02 | Paper |
Digital Logic Design
| 2012-12-13 | Paper |
Revisiting randomized parallel load balancing algorithms
Theoretical Computer Science | 2012-08-10 | Paper |
Hitting sets online and vertex ranking
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Parallel randomized load balancing: a lower bound for a more general model
Theoretical Computer Science | 2011-05-10 | Paper |
A strongly polynomial algorithm for controlled queues
Mathematics of Operations Research | 2011-04-27 | Paper |
An \(O(\log n)\)-competitive online centralized randomized packet-routing algorithm for lines
Automata, Languages and Programming | 2010-09-07 | Paper |
Set connectivity problems in undirected graphs and the directed Steiner network problem
| 2010-08-06 | Paper |
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Lecture Notes in Computer Science | 2010-05-26 | Paper |
On approximating a geometric prize-collecting traveling salesman problem with time windows (extended abstract)
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Revisiting Randomized Parallel Load Balancing Algorithms
Structural Information and Communication Complexity | 2010-02-24 | Paper |
Parallel randomized load balancing: a lower bound for a more general model
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Hitting sets when the VC-dimension is small
Information Processing Letters | 2009-12-04 | Paper |
Scheduling with conflicts: Online and offline algorithms
Journal of Scheduling | 2009-09-25 | Paper |
Optimal conclusive sets for comparator networks
Theoretical Computer Science | 2009-03-30 | Paper |
Improved Bounds on the Word Error Probability of<tex>$RA(2)$</tex>Codes With Linear-Programming-Based Decoding
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
Combinatorial and Algorithmic Aspects of Networking | 2008-04-17 | Paper |
Optimal Conclusive Sets for Comparator Networks
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Approximation Algorithms for Capacitated Rectangle Stabbing
Lecture Notes in Computer Science | 2007-05-02 | Paper |
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics | 2006-01-10 | Paper |
On approximating a geometric prize-collecting traveling salesman problem with time windows
Journal of Algorithms | 2005-05-04 | Paper |
A parametric error analysis of Goldschmidt's division algorithm
Journal of Computer and System Sciences | 2005-02-23 | Paper |
Min-max tree covers of graphs.
Operations Research Letters | 2005-01-11 | Paper |
scientific article; zbMATH DE number 2119643 (Why is no real title available?)
| 2004-11-29 | Paper |
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
SIAM Journal on Computing | 2004-01-08 | Paper |
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
SIAM Journal on Computing | 2003-06-19 | Paper |
scientific article; zbMATH DE number 1833404 (Why is no real title available?)
| 2002-11-21 | Paper |
Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems
Journal of Graph Algorithms and Applications | 2002-01-07 | Paper |
scientific article; zbMATH DE number 1538536 (Why is no real title available?)
| 2001-11-06 | Paper |
An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
SIAM Journal on Computing | 2000-10-18 | Paper |
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
Efficient approximation of product distributions
| 1999-12-19 | Paper |
Overcoming chip-to-chip delays and clock skews
Integration | 1999-01-12 | Paper |
Mirroring: a technique for pipelining semi-systolic and systolic arrays
Integration | 1998-08-13 | Paper |
A real-time systolic integer multiplier
Integration | 1998-06-30 | Paper |
Approximating minimum feedback sets and multicuts in directed graphs
Algorithmica | 1998-01-01 | Paper |
Lower bounds for sampling algorithms for estimating the average
Information Processing Letters | 1997-02-28 | Paper |
The Retiming Lemma: A simple proof and applications
Integration | 1997-02-27 | Paper |
