| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q4633881 | 2019-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633939 | 2019-05-06 | Paper |
| Approximating frequent items in asynchronous data stream over a sliding window | 2019-03-26 | Paper |
| Compressed indexes for dynamic text collections | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501359 | 2015-08-03 | Paper |
| Non-clairvoyant weighted flow time scheduling on different multi-processor models | 2015-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934666 | 2014-12-18 | Paper |
| Speed Scaling with an Arbitrary Power Function | 2014-12-05 | Paper |
| Algorithms and complexity for periodic real-time scheduling | 2014-12-05 | Paper |
| Optimizing throughput and energy in online deadline scheduling | 2014-11-18 | Paper |
| Dynamic dictionary matching and compressed suffix trees | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417713 | 2014-05-22 | Paper |
| Speed scaling of processes with arbitrary speedup curves on a multiprocessor | 2012-12-10 | Paper |
| Online Flow Time Scheduling in the Presence of Preemption Overhead | 2012-11-02 | Paper |
| Improved bounds for speed scaling in devices obeying the cube-root rule | 2012-09-27 | Paper |
| Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models | 2012-07-16 | Paper |
| A note on sorting buffers offline | 2012-05-14 | Paper |
| Continuous monitoring of distributed data streams over a time-based sliding window | 2012-04-26 | Paper |
| Nonclairvoyant Speed Scaling for Flow and Energy | 2012-04-24 | Paper |
| Continuous Monitoring of Distributed Data Streams Over a Time-based Sliding Window | 2012-01-23 | Paper |
| A linear size index for approximate pattern matching | 2012-01-04 | Paper |
| Edit Distance to Monotonicity in Sliding Windows | 2011-12-16 | Paper |
| Nonclairvoyant speed scaling for flow and energy | 2011-11-07 | Paper |
| Average rate speed scaling | 2011-07-01 | Paper |
| Energy-Efficient Due Date Scheduling | 2011-05-12 | Paper |
| Competitive algorithms for due date scheduling | 2011-03-30 | Paper |
| Tradeoff between Energy and Throughput for Online Deadline Scheduling | 2011-02-15 | Paper |
| Compressed indexes for approximate string matching | 2010-09-16 | Paper |
| Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling | 2010-08-16 | Paper |
| Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window | 2010-05-11 | Paper |
| Speed scaling with a solar cell | 2009-11-04 | Paper |
| Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling | 2008-10-28 | Paper |
| Non-overlapping common substrings allowing mutations | 2008-09-08 | Paper |
| Scheduling for Speed Bounded Processors | 2008-08-28 | Paper |
| Speed Scaling with a Solar Cell | 2008-07-10 | Paper |
| Average Rate Speed Scaling | 2008-04-15 | Paper |
| Compressed Indexes for Approximate String Matching | 2008-03-11 | Paper |
| Competitive Algorithms for Due Date Scheduling | 2007-11-28 | Paper |
| A Linear Size Index for Approximate Pattern Matching | 2007-09-14 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Nonmigratory Online Deadline Scheduling on Multiprocessors | 2005-09-16 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
