| Publication | Date of Publication | Type |
|---|
Conservative algorithms for parallel and sequential integer sorting
Lecture Notes in Computer Science | 2023-12-12 | Paper |
More Efficient Parallel Integer Sorting
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
On Petrie cycle and Petrie tour partitions of 3- and 4-regular plane graphs
Mathematical Structures in Computer Science | 2022-11-17 | Paper |
Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space
Algorithmica | 2020-02-28 | Paper |
Optimal parallel selection
ACM Transactions on Algorithms | 2018-11-05 | Paper |
An optimal linked list prefix algorithm on a local memory computer
IEEE Transactions on Computers | 2018-09-14 | Paper |
Sublogarithmic deterministic selection on arrays with a reconfigurable optical bus
IEEE Transactions on Computers | 2018-07-09 | Paper |
Algorithms for testing occurrences of length 4 patterns in permutations
Journal of Combinatorial Optimization | 2018-02-21 | Paper |
Construct a perfect word hash function in time independent of the size of integers
Information Processing Letters | 2017-09-19 | Paper |
An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths
Journal of Discrete Algorithms | 2016-12-09 | Paper |
A Linear Time Algorithm for Ordered Partition
Frontiers in Algorithmics | 2015-11-12 | Paper |
Algorithms for Testing Length Four Permutations
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Erratum to: Tight bound for matching
Journal of Combinatorial Optimization | 2013-08-02 | Paper |
An \(O(n ^{3} \log\log n/\log ^{2} n)\) time algorithm for all pairs shortest paths
Algorithm Theory – SWAT 2012 | 2012-08-14 | Paper |
More efficient parallel integer sorting
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Tight bound for matching
Journal of Combinatorial Optimization | 2012-07-03 | Paper |
An efficient parallel algorithm for building the separating tree
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
Deterministic sorting in O ( n log log n ) time and linear space
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
A note of an \(O(n^{3}/\log n)\) time algorithm for all pairs shortest paths
Information Processing Letters | 2010-03-24 | Paper |
Improved algorithm for the symmetry number problem on trees
Information Processing Letters | 2010-01-18 | Paper |
An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
Algorithmica | 2008-07-01 | Paper |
Matching for Graphs of Bounded Degree
Frontiers in Algorithmics | 2008-06-19 | Paper |
An O(n 3 (loglogn/logn)5/4) Time Algorithm for All Pairs Shortest Paths
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Distribution of path durations in mobile ad-hoc networks -- Palm's theorem to the rescue
Computer Networks | 2006-08-16 | Paper |
Deterministic sorting in O(nloglogn) time and linear space
Journal of Algorithms | 2004-10-04 | Paper |
| scientific article; zbMATH DE number 2079315 (Why is no real title available?) | 2004-07-28 | Paper |
Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
Journal of the ACM | 2003-06-25 | Paper |
Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers
International Journal of Computer Mathematics | 2003-05-08 | Paper |
Improving the efficiency of parallel minimum spanning tree algorithms
Discrete Applied Mathematics | 2003-03-09 | Paper |
Improved fast integer sorting in linear space
Information and Computation | 2003-01-14 | Paper |
Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs
SIAM Journal on Computing | 2003-01-05 | Paper |
| Improved fast integer sorting in linear space | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1629826 (Why is no real title available?) | 2001-11-01 | Paper |
Very fast parallel algorithms for approximate edge coloring
Discrete Applied Mathematics | 2001-09-03 | Paper |
| scientific article; zbMATH DE number 1305432 (Why is no real title available?) | 2000-04-13 | Paper |
| scientific article; zbMATH DE number 1398092 (Why is no real title available?) | 2000-02-03 | Paper |
Parallel PROFIT/COST algorithms through fast derandomization
Acta Informatica | 1999-11-29 | Paper |
| scientific article; zbMATH DE number 1305411 (Why is no real title available?) | 1999-06-17 | Paper |
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
Algorithmica | 1997-08-20 | Paper |
An improvement on parallel computation of a maximal matching
Information Processing Letters | 1997-02-28 | Paper |
SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
International Journal of Computational Geometry & Applications | 1997-01-13 | Paper |
A Fast Derandomization Scheme and Its Applications
SIAM Journal on Computing | 1996-06-05 | Paper |
| scientific article; zbMATH DE number 403947 (Why is no real title available?) | 1993-09-06 | Paper |
| scientific article; zbMATH DE number 177547 (Why is no real title available?) | 1993-05-18 | Paper |
Indexing functions and time lower bounds for sorting on a mesh-connected computer
Discrete Applied Mathematics | 1992-09-27 | Paper |
Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
Information Processing Letters | 1990-01-01 | Paper |
An efficient and fast parallel-connected component algorithm
Journal of the ACM | 1990-01-01 | Paper |
Time lower bounds for parallel sorting on a mesh-connected processor array
Acta Informatica | 1989-01-01 | Paper |
