| Publication | Date of Publication | Type |
|---|
| An extendable data structure for incremental stable perfect hashing | 2023-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059168 | 2023-11-02 | Paper |
| Dynamic dictionaries for multisets and counting filters with constant time operations | 2023-06-05 | Paper |
| Upper tail analysis of bucket sort and random tries | 2023-03-22 | Paper |
| Optimal distributed covering algorithms | 2023-03-14 | Paper |
| Approximating minimum feedback sets and multi-cuts in directed graphs | 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 | 2022-02-22 | Paper |
| Upper tail analysis of bucket sort and random tries | 2021-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009500 | 2021-08-04 | Paper |
| Optimal Distributed Covering Algorithms | 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 | 2019-11-22 | Paper |
| On-line path computation and function placement in SDNs | 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 |
| Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs | 2018-11-05 | Paper |
| A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2 | 2018-11-05 | Paper |
| Best of two local models: centralized local and distributed local algorithms | 2018-09-27 | Paper |
| On the design of IEEE compliant floating point units | 2018-07-09 | Paper |
| Minimal controllability of conjunctive Boolean networks is NP-complete | 2018-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4568110 | 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 | 2017-10-09 | Paper |
| LP Decoding of Regular LDPC Codes in Memoryless Channels | 2017-07-27 | Paper |
| On Decoding Irregular Tanner Codes With Local-Optimality Guarantees | 2017-06-08 | Paper |
| Observability of Boolean networks: a graph-theoretic approach | 2017-06-02 | Paper |
| Deterministic Rateless Codes for BSC | 2017-05-19 | Paper |
| Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming | 2017-04-28 | Paper |
| An Approximation Algorithm for Path Computation and Function Placement in SDNs | 2016-12-01 | Paper |
| On network design problems: fixed cost flows and the covering steiner problem | 2015-09-02 | Paper |
| A nonmonotone analysis with the primal-dual approach: online routing of virtual circuits with unknown durations | 2015-05-22 | Paper |
| Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs | 2014-10-08 | Paper |
| Improved approximations of crossings in graph drawings | 2014-09-26 | Paper |
| Hitting sets online and unique-MAX coloring | 2014-09-12 | Paper |
| Set connectivity problems in undirected graphs and the directed steiner network problem | 2014-09-09 | Paper |
| Local-Optimality Guarantees Based on Paths for Optimal Decoding | 2014-04-10 | Paper |
| Competitive and deterministic embeddings of virtual networks | 2014-01-10 | Paper |
| A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations | 2013-12-17 | Paper |
| Online Multi-Commodity Flow with High Demands | 2013-09-13 | Paper |
| A \(1.5\)-approximation algorithm for augmenting edge-connectivity of a graph from \(1\) to \(2\) | 2013-04-04 | Paper |
| Strong polynomiality of the Gass-Saaty shadow-vertex pivoting rule for controlled random walks | 2013-04-02 | Paper |
| Digital Logic Design | 2012-12-13 | Paper |
| Revisiting randomized parallel load balancing algorithms | 2012-08-10 | Paper |
| Hitting Sets Online and Vertex Ranking | 2011-09-16 | Paper |
| Parallel randomized load balancing: a lower bound for a more general model | 2011-05-10 | Paper |
| A Strongly Polynomial Algorithm for Controlled Queues | 2011-04-27 | Paper |
| An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines | 2010-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579405 | 2010-08-06 | Paper |
| Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques | 2010-05-26 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Revisiting Randomized Parallel Load Balancing Algorithms | 2010-02-24 | Paper |
| Parallel Randomized Load Balancing: A Lower Bound for a More General Model | 2010-01-28 | Paper |
| Hitting sets when the VC-dimension is small | 2009-12-04 | Paper |
| Scheduling with conflicts: Online and offline algorithms | 2009-09-25 | Paper |
| Optimal conclusive sets for comparator networks | 2009-03-30 | Paper |
| Improved Bounds on the Word Error Probability of<tex>$RA(2)$</tex>Codes With Linear-Programming-Based Decoding | 2008-12-21 | Paper |
| Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs | 2008-04-17 | Paper |
| Optimal Conclusive Sets for Comparator Networks | 2007-11-15 | Paper |
| Approximation Algorithms for Capacitated Rectangle Stabbing | 2007-05-02 | Paper |
| A greedy approximation algorithm for the group Steiner problem | 2006-01-10 | Paper |
| On approximating a geometric prize-collecting traveling salesman problem with time windows | 2005-05-04 | Paper |
| A parametric error analysis of Goldschmidt's division algorithm | 2005-02-23 | Paper |
| Min-max tree covers of graphs. | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828914 | 2004-11-29 | Paper |
| On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem | 2004-08-12 | Paper |
| Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks | 2004-01-08 | Paper |
| Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas | 2003-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780785 | 2002-11-21 | Paper |
| Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems | 2002-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4519130 | 2001-11-06 | Paper |
| An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem | 2000-10-18 | Paper |
| Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications | 2000-07-20 | Paper |
| Efficient approximation of product distributions | 1999-12-19 | Paper |
| Overcoming chip-to-chip delays and clock skews | 1999-01-12 | Paper |
| Mirroring: a technique for pipelining semi-systolic and systolic arrays | 1998-08-13 | Paper |
| A real-time systolic integer multiplier | 1998-06-30 | Paper |
| Approximating minimum feedback sets and multicuts in directed graphs | 1998-01-01 | Paper |
| Lower bounds for sampling algorithms for estimating the average | 1997-02-28 | Paper |
| The Retiming Lemma: A simple proof and applications | 1997-02-27 | Paper |
