| Publication | Date of Publication | Type |
|---|
| Two-dimensional pattern matching on a dynamic library of texts | 2023-12-12 | Paper |
| Computing the unrooted maximum agreement subtree in sub-quadratic time | 2022-12-09 | Paper |
| Scheduling with gaps: new models and algorithms | 2021-12-13 | Paper |
| RENET: a deep learning approach for extracting gene-disease associations from literature | 2019-05-21 | Paper |
| Approximating frequent items in asynchronous data stream over a sliding window | 2019-03-26 | Paper |
| Dictionary matching with a bounded gap in pattern or in text | 2018-04-06 | Paper |
| Scheduling with Gaps: New Models and Algorithms | 2015-09-21 | Paper |
| Compressed indexes for dynamic text collections | 2015-09-02 | Paper |
| Dictionary Matching with Uneven Gaps | 2015-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501359 | 2015-08-03 | Paper |
| Compressing dictionary matching index via sparsification technique | 2015-07-10 | Paper |
| Non-clairvoyant weighted flow time scheduling on different multi-processor models | 2015-05-12 | Paper |
| APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES | 2015-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934666 | 2014-12-18 | Paper |
| Optimizing throughput and energy in online deadline scheduling | 2014-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921649 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414590 | 2014-05-06 | Paper |
| Improved multi-processor scheduling for flow time and energy | 2014-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2845522 | 2013-08-30 | Paper |
| Online speed scaling based on active job count to minimize flow plus energy | 2013-08-05 | Paper |
| Scheduling for weighted flow time and energy with rejection penalty | 2013-02-19 | Paper |
| Online Flow Time Scheduling in the Presence of Preemption Overhead | 2012-11-02 | Paper |
| Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models | 2012-07-16 | Paper |
| Continuous monitoring of distributed data streams over a time-based sliding window | 2012-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389982 | 2012-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113704 | 2012-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113747 | 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 |
| Cache-oblivious index for approximate string matching | 2011-07-14 | Paper |
| Sleep Management on Multiple Machines for Energy and Flow Time | 2011-07-06 | Paper |
| Energy-Efficient Due Date Scheduling | 2011-05-12 | Paper |
| Tradeoff between Energy and Throughput for Online Deadline Scheduling | 2011-02-15 | Paper |
| Online Tracking of the Dominance Relationship of Distributed Multi-dimensional Data | 2011-02-15 | Paper |
| Deadline scheduling and power management for speed bounded processors | 2010-10-11 | Paper |
| Compressed indexes for approximate string matching | 2010-09-16 | Paper |
| Non-clairvoyant Speed Scaling for Weighted Flow Time | 2010-09-06 | Paper |
| Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling | 2010-08-16 | Paper |
| A unified analysis of hot video schedulers | 2010-08-05 | Paper |
| Indexing Similar DNA Sequences | 2010-07-20 | Paper |
| Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window | 2010-05-11 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Non-shared edges and nearest neighbor interchanges revisited | 2009-07-21 | Paper |
| Sleep with Guilt and Work Faster to Minimize Flow Plus Energy | 2009-07-14 | Paper |
| An Experimental Study of Compressed Indexing and Local Alignments of DNA | 2009-03-03 | Paper |
| Dynamic bin packing of unit fractions items | 2009-01-08 | Paper |
| Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count | 2008-11-25 | 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 |
| Improved approximate string matching using compressed suffix data structures | 2008-07-01 | Paper |
| Cache-Oblivious Index for Approximate String Matching | 2008-06-17 | Paper |
| Energy Efficient Deadline Scheduling in Two Processor Systems | 2008-05-27 | Paper |
| Space Efficient Indexes for String Matching with Don’t Cares | 2008-05-27 | Paper |
| Compressed Indexes for Approximate String Matching | 2008-03-11 | Paper |
| Competitive deadline scheduling via additional or faster processors | 2007-12-20 | Paper |
| Online Deadline Scheduling with Bounded Energy Efficiency | 2007-11-13 | Paper |
| A Linear Size Index for Approximate Pattern Matching | 2007-09-14 | Paper |
| A space and time efficient algorithm for constructing compressed suffix arrays | 2007-07-19 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling | 2006-09-14 | Paper |
| Approximate string matching using compressed suffix arrays | 2006-03-24 | Paper |
| On-line stream merging with max span and min coverage | 2006-02-08 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Nonmigratory Online Deadline Scheduling on Multiprocessors | 2005-09-16 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| A tighter extra-resource analysis of online deadline scheduling | 2005-06-08 | Paper |
| SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES | 2005-02-28 | Paper |
| Extra processors versus future information in optimal deadline scheduling | 2005-02-08 | Paper |
| Performance guarantee for edf under overload | 2004-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808661 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472521 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472525 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437498 | 2003-12-02 | Paper |
| On-line scheduling with tight deadlines. | 2003-08-17 | Paper |
| On-line stream merging in a general setting. | 2003-08-17 | Paper |
| Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708569 | 2003-06-18 | Paper |
| Improving the efficiency of parallel minimum spanning tree algorithms | 2003-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779165 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553240 | 2002-11-04 | Paper |
| Optimal edge ranking of trees in linear time | 2002-05-14 | Paper |
| An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings | 2002-04-08 | Paper |
| On-line load balancing of temporary tasks revisited | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2768377 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723946 | 2001-07-08 | Paper |
| A Decomposition Theorem for Maximum Weight Bipartite Matchings | 2001-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526970 | 2001-02-28 | Paper |
| Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953351 | 2000-05-09 | Paper |
| Selecting the \(k\) largest elements with parity tests | 2000-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938785 | 2000-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4249526 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250211 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252292 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252341 | 1999-06-17 | Paper |
| Edge ranking of graphs is hard | 1998-12-10 | Paper |
| An improved scheme for set equality testing and updating | 1998-08-13 | Paper |
| Approximating biconnectivity in parallel | 1998-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370211 | 1998-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129918 | 1997-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875165 | 1996-04-28 | Paper |
| Finding Connected Components in O(log n log log n) Time on the EREW PRAM | 1995-07-03 | Paper |
| AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT | 1995-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140396 | 1993-12-15 | Paper |
| Trade-offs between communication and space | 1993-01-17 | Paper |
| Results on communication complexity classes | 1992-09-27 | Paper |
