| Publication | Date of Publication | Type |
|---|
The DAG visit approach for pebbling and I/O lower bounds
| 2024-09-12 | Paper |
Bounds and estimates on the average edit distance
| 2024-04-19 | Paper |
Lower bounds to processor-time tradeoffs under bounded-speed message propagation
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Language learning without overgeneralization
STACS 92 | 2022-08-18 | Paper |
The I/O complexity of Toom-Cook integer multiplication
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Merging and sorting networks with the topology of the omega network
IEEE Transactions on Computers | 2018-09-14 | Paper |
Network-oblivious algorithms
Journal of the ACM | 2018-08-02 | Paper |
The I/O complexity of Strassen's matrix multiplication with recomputation
| 2017-09-22 | Paper |
Algorithms for computing the static single assignment form
Journal of the ACM | 2015-11-12 | Paper |
On approximating the ideal random access machine by physical machines
Journal of the ACM | 2015-11-11 | Paper |
Optimal eviction policies for stochastic address traces
Theoretical Computer Science | 2013-12-11 | Paper |
Area-time tradeoffs for universal VLSI circuits
Theoretical Computer Science | 2008-12-12 | Paper |
The role of terminal cost/reward in finite-horizon discrete-time LQ optimal control
Linear Algebra and its Applications | 2007-08-27 | Paper |
On stalling in LogP
Journal of Parallel and Distributed Computing | 2005-06-30 | Paper |
A frontal solver tuned for fully coupled non-linear hygro-thermo-mechanical problems
International Journal for Numerical Methods in Engineering | 2004-02-03 | Paper |
On bufferless routing of variable length messages in leveled networks
IEEE Transactions on Computers | 2003-11-02 | Paper |
scientific article; zbMATH DE number 1857504 (Why is no real title available?)
| 2003-01-29 | Paper |
Tight bounds on parallel list marking
Journal of Parallel and Distributed Computing | 2002-11-24 | Paper |
scientific article; zbMATH DE number 1696521 (Why is no real title available?)
| 2002-07-22 | Paper |
scientific article; zbMATH DE number 1756010 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1760004 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1728434 (Why is no real title available?)
| 2002-04-15 | Paper |
BSP versus LogP
Algorithmica | 2000-09-05 | Paper |
A lower bound for area-universal graphs
Information Processing Letters | 2000-08-02 | Paper |
Processor-time tradeoffs under bounded-speed message propagation. II: Lower bounds
Theory of Computing Systems | 2000-02-02 | Paper |
Processor-time tradeoffs under bounded-speed message propagation. I: Upper bounds
Theory of Computing Systems | 1998-05-25 | Paper |
Deterministic on-line routing on area-universal networks
Journal of the ACM | 1998-01-28 | Paper |
Language learning without overgeneralization
Theoretical Computer Science | 1997-02-28 | Paper |
Horizons of parallel computation
Journal of Parallel and Distributed Computing | 1996-02-26 | Paper |
Deterministic Simulations of PRAM<scp>s</scp> on Bounded Degree Networks
SIAM Journal on Computing | 1994-06-16 | Paper |
On uniform learnability of language families
Information Processing Letters | 1993-01-04 | Paper |
Memory requirements of first-order digital filters
IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing | 1992-10-06 | Paper |
Characterization of Associative Operations with Prefix Circuits of Constant Depth and Linear Size
SIAM Journal on Computing | 1990-01-01 | Paper |
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
SIAM Journal on Computing | 1989-01-01 | Paper |
Size-time complexity of Boolean networks for prefix computations
Journal of the ACM | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4119627 (Why is no real title available?)
| 1989-01-01 | Paper |
Area-time lower-bound techniques with applications to sorting
Algorithmica | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3959293 (Why is no real title available?)
| 1986-01-01 | Paper |
scientific article; zbMATH DE number 3911723 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3896293 (Why is no real title available?)
| 1985-01-01 | Paper |
A Minimum Area VLSI Network for O(log n) Time Sorting
IEEE Transactions on Computers | 1985-01-01 | Paper |
Mean value of the output of a discrete-time Volterra system driven by a Markov chain (Corresp.)
IEEE Transactions on Information Theory | 1985-01-01 | Paper |
An Architecture for Bitonic Sorting with Optimal VLSI Performnance
IEEE Transactions on Computers | 1984-01-01 | Paper |
Permutation-exchange graphs that emulate the binary cube
Mathematical Systems Theory | 1984-01-01 | Paper |
Spectral Analysis of Functions of Markov Chains with Applications
IEEE Transactions on Communications | 1983-01-01 | Paper |
Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance
| N/A | Paper |
