The following pages link to Dennis Shasha (Q686640):
Displaying 24 items.
- \(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half (Q686641) (← links)
- An index structure for data mining and clustering (Q698712) (← links)
- Data mining in bioinformatics (Q704866) (← links)
- On the editing distance between unordered labeled trees (Q1198043) (← links)
- MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling (Q1330422) (← links)
- Efficient data reconciliation (Q1602501) (← links)
- Fast analytical methods for finding significant labeled graph motifs (Q1741244) (← links)
- (Q2765483) (← links)
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems (Q3034830) (← links)
- Fast methods for finding significant motifs on labelled multi-relational networks (Q3388961) (← links)
- Approximate Tree Matching in the Presence of Variable Length Don′t Cares (Q4289840) (← links)
- Concurrent search structure algorithms (Q4711357) (← links)
- (Q4833539) (← links)
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems (Q4834383) (← links)
- (Q4839150) (← links)
- (Q4854014) (← links)
- ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS (Q4888367) (← links)
- Automated Verification of Concurrent Search Structures (Q5000450) (← links)
- Building secure file systems out of byzantine storage (Q5170872) (← links)
- Exact and approximate algorithms for unordered tree matching (Q5365715) (← links)
- Products of mixed covering arrays of strength two (Q5469151) (← links)
- Fast algorithms for the unit cost editing distance between trees (Q5750416) (← links)
- Statistics is Easy! Second Edition (Q5858223) (← links)
- Statistics is Easy: Case Studies on Real Scientific Datasets (Q5858256) (← links)
