| Publication | Date of Publication | Type |
|---|
| Online Evidential Nearest Neighbour Classification for Internet of Things Time Series | 2024-04-05 | Paper |
| Efficient algorithms for finding edit-distance based motifs | 2019-07-25 | Paper |
| On string matching with mismatches | 2019-03-26 | Paper |
| Optimal and Practical Algorithms for Sorting on the PDM | 2017-11-10 | Paper |
| On pattern matching with \(k\) mismatches and few don't cares | 2016-11-23 | Paper |
| Self assembly of rectangular shapes on concentration programming and probabilistic tile assembly models | 2016-07-08 | Paper |
| An optimal parallel algorithm for sorting multisets | 2016-06-09 | Paper |
| An Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time | 2016-04-13 | Paper |
| Novel Randomized Feature Selection Algorithms | 2015-09-29 | Paper |
| PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH | 2015-04-29 | Paper |
| An elegant algorithm for the construction of suffix arrays | 2014-07-07 | Paper |
| EMS1: an elegant algorithm for edit distance based motif search | 2013-10-23 | Paper |
| AN EFFICIENT ALGORITHM FOR CHINESE POSTMAN WALK ON BI-DIRECTED DE BRUIJN GRAPHS | 2012-10-15 | Paper |
| A relaxation scheme for increasing the parallelism in Jacobi-SVD | 2012-07-26 | Paper |
| Communication and energy efficient routing protocols for single-hop radio networks | 2012-07-13 | Paper |
| Efficient out-of-core sorting algorithms for the parallel disks model | 2011-11-10 | Paper |
| Efficient algorithms for self assembling non-rectangular nano structures | 2011-05-23 | Paper |
| Randomized Self Assembly of Rectangular Nano Structures | 2011-01-28 | Paper |
| ON THE HARDNESS OF THE BORDER LENGTH MINIMIZATION PROBLEM ON A RECTANGULAR ARRAY | 2011-01-19 | Paper |
| An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs | 2011-01-08 | Paper |
| Fast algorithms for placing large entries along the diagonal of a sparse matrix | 2010-10-11 | Paper |
| A generalization of the 0-1 principle for sorting | 2009-12-04 | Paper |
| SPECTRUM BASED TECHNIQUES FOR GRAPH ISOMORPHISM | 2009-06-30 | Paper |
| Space and Time Efficient Algorithms for Planted Motif Search | 2008-12-09 | Paper |
| Robust Network Supercomputing with Malicious Processes | 2008-09-09 | Paper |
| EFFICIENT ALGORITHMS FOR DEGENERATE PRIMER SEARCH | 2008-05-20 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| EFFICIENT ALGORITHMS FOR SELECTION AND SORTING OF LARGE DISTRIBUTED FILES ON DE BRUIJN AND HYPERCUBE STRUCTURES | 2005-10-19 | Paper |
| Packet routing and selection on the POPS network | 2005-08-01 | Paper |
| RANDOMIZED SORTING ON THE POPS NETWORK | 2005-05-06 | Paper |
| PARALLIZING 1-DIMENSIONAL ESTUARINE MODEL | 2005-02-28 | Paper |
| Out-of-core computing on mesh connected computers | 2005-01-31 | Paper |
| SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS | 2004-10-06 | Paper |
| Efficient algorithms for local alignment search | 2004-01-07 | Paper |
| Efficient algorithms for similarity search | 2004-01-07 | Paper |
| Mesh connected computers with fixed and reconfigurable buses: packet routing and sorting | 2003-06-25 | Paper |
| Selection algorithms for parallel disk systems | 2003-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4785972 | 2002-12-12 | Paper |
| Optimal parallel randomized algorithms for the Voronoi diagram of line segments in the plane | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552063 | 2002-08-28 | Paper |
| Permutation routing on reconfigurable meshes | 2002-03-04 | Paper |
| A framework for simple sorting algorithms on parallel disk systems | 2002-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788596 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247467 | 2000-09-26 | Paper |
| On simulated annealing and nested annealing. | 2000-09-14 | Paper |
| TAL recognition in \(O(M(n^2))\) time | 1999-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251081 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224934 | 1999-05-18 | Paper |
| Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses | 1998-11-11 | Paper |
| Unifying themes for selection on any network | 1998-10-01 | Paper |
| Tree-Adjoining Language Parsing in $O(n^6 )$ Time | 1996-12-09 | Paper |
| Fast algorithms for generating discrete random variates with changing distributions | 1996-06-13 | Paper |
| k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh | 1996-01-16 | Paper |
| A randomized algorithm for multipacket routing on the mesh | 1995-07-20 | Paper |
| Optimal mesh algorithms for the Voronoi diagram of line segments and motion planning in the plane | 1995-07-06 | Paper |
| The light bulb problem | 1995-07-06 | Paper |
| Packet routing and PRAM emulation on star graphs and leveled networks | 1994-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035691 | 1993-05-18 | Paper |
| Constant queue routing on a mesh | 1993-01-17 | Paper |
| Nested annealing: A provable improvement to simulated annealing | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013544 | 1992-09-27 | Paper |
| Optimal routing algorithms for mesh-connected processor arrays | 1992-08-13 | Paper |
| On parallel integer sorting | 1992-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359742 | 1990-01-01 | Paper |
| Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3802892 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783528 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785933 | 1987-01-01 | Paper |
