| Publication | Date of Publication | Type |
|---|
Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
Foundations and Trends® in Databases | 2023-12-19 | Paper |
High Performance, Low Energy, and Trustworthy Blockchains Using Satellites
Foundations and Trends® in Networking | 2023-12-19 | Paper |
Automated Verification of Concurrent Search Structures
Synthesis Lectures on Computer Science | 2021-07-13 | Paper |
Fast methods for finding significant motifs on labelled multi-relational networks
Journal of Complex Networks | 2021-05-07 | Paper |
Statistics is Easy! Second Edition
Synthesis Lectures on Mathematics and Statistics | 2021-04-12 | Paper |
Statistics is easy. Case studies on real scientific datasets
Synthesis Lectures on Mathematics and Statistics | 2021-04-12 | Paper |
Fast analytical methods for finding significant labeled graph motifs
Data Mining and Knowledge Discovery | 2019-05-03 | Paper |
Exact and approximate algorithms for unordered tree matching
IEEE Transactions on Systems, Man, and Cybernetics | 2017-10-09 | Paper |
Building secure file systems out of Byzantine storage
Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
Products of mixed covering arrays of strength two
Journal of Combinatorial Designs | 2006-05-16 | Paper |
Data mining in bioinformatics
Advanced Information and Knowledge Processing | 2005-01-20 | Paper |
scientific article; zbMATH DE number 2123114 (Why is no real title available?)
| 2004-12-15 | Paper |
An index structure for data mining and clustering
Knowledge and Information Systems | 2003-01-08 | Paper |
Finding approximate patterns in undirected acyclic graphs
Pattern Recognition | 2002-09-29 | Paper |
Algorithms and experience in increasing the intelligibility and hygiene of access control in large organizations
| 2002-08-05 | Paper |
Efficient data reconciliation
Information Sciences | 2002-06-23 | Paper |
MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling
Theoretical Computer Science | 2000-06-21 | Paper |
ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS
International Journal of Foundations of Computer Science | 1996-11-26 | Paper |
$\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing | 1996-03-18 | Paper |
scientific article; zbMATH DE number 813678 (Why is no real title available?)
| 1995-11-08 | Paper |
scientific article; zbMATH DE number 774346 (Why is no real title available?)
| 1995-07-16 | Paper |
Approximate Tree Matching in the Presence of Variable Length Don′t Cares
Journal of Algorithms | 1995-01-02 | Paper |
\(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half
Journal of Computer and System Sciences | 1993-10-10 | Paper |
On the editing distance between unordered labeled trees
Information Processing Letters | 1993-01-16 | Paper |
Concurrent search structure algorithms
ACM Transactions on Database Systems | 1992-06-25 | Paper |
Fast algorithms for the unit cost editing distance between trees
Journal of Algorithms | 1990-01-01 | Paper |
Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
SIAM Journal on Computing | 1989-01-01 | Paper |
