| Publication | Date of Publication | Type |
|---|
Fair subgraph selection for contagion containment
Procedia Computer Science | 2025-12-11 | Paper |
| Multi-channel assignment and link scheduling for prioritized latency-sensitive applications | 2024-04-05 | Paper |
| Algorithm design for tensor units | 2022-03-31 | Paper |
Cache-oblivious buffer heap and cache-efficient computation of shortest paths in graphs
ACM Transactions on Algorithms | 2018-11-12 | Paper |
The range 1 query (R1Q) problem
Theoretical Computer Science | 2018-08-23 | Paper |
| An efficient cache-oblivious parallel Viterbi algorithm | 2018-01-11 | Paper |
Optimizing Read Reversals for Sequence Compression
Lecture Notes in Computer Science | 2017-07-25 | Paper |
The I/O complexity of computing prime tables
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Oblivious algorithms for multicores and networks of processors
Journal of Parallel and Distributed Computing | 2015-12-17 | Paper |
The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
Theory of Computing Systems | 2015-01-21 | Paper |
| External-memory exact and approximate all-pairs shortest-paths in undirected graphs | 2014-10-13 | Paper |
The Range 1 Query (R1Q) Problem
Lecture Notes in Computer Science | 2014-09-26 | Paper |
The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
Theory of Computing Systems | 2010-12-17 | Paper |
Cache-oblivious dynamic programming
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5764815 (Why is no real title available?) | 2010-08-06 | Paper |
Oracles for Distances Avoiding a Failed Node or Link
SIAM Journal on Computing | 2008-10-28 | Paper |
Compiler Construction
Lecture Notes in Computer Science | 2007-09-28 | Paper |
| scientific article; zbMATH DE number 2065978 (Why is no real title available?) | 2004-05-18 | Paper |
A New String Matching Algorithm
International Journal of Computer Mathematics | 2004-02-11 | Paper |
| scientific article; zbMATH DE number 1979527 (Why is no real title available?) | 2003-09-14 | Paper |
On average edge length of minimum spanning trees
Information Processing Letters | 2002-07-25 | Paper |
An efficient decoding technique for Huffman codes
Information Processing Letters | 2002-07-14 | Paper |
Sorting using heap structure
International Journal of Computer Mathematics | 2001-10-16 | Paper |
Calculating the square root with arbitrary order of convergence
International Journal of Computer Mathematics | 2000-11-20 | Paper |
A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort
International Journal of Computer Mathematics | 2000-04-09 | Paper |
Mode-finding algorithms revisited
International Journal of Computer Mathematics | 1999-06-28 | Paper |
