Dennis Shasha

Available identifiers

zbMath Open shasha.dennis-eDBLPs/DennisShashaWikidataQ5258945 ScholiaQ5258945MaRDI QIDQ686640

List of research outcomes

Publication	Date of Publication	Type
Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines	2023-12-19	Paper
High Performance, Low Energy, and Trustworthy Blockchains Using Satellites	2023-12-19	Paper
Automated Verification of Concurrent Search Structures	2021-07-13	Paper
Fast methods for finding significant motifs on labelled multi-relational networks	2021-05-07	Paper
Statistics is Easy! Second Edition	2021-04-12	Paper
Statistics is Easy: Case Studies on Real Scientific Datasets	2021-04-12	Paper
Fast analytical methods for finding significant labeled graph motifs	2019-05-03	Paper
Exact and approximate algorithms for unordered tree matching	2017-10-09	Paper
Building secure file systems out of byzantine storage	2014-07-25	Paper
Products of mixed covering arrays of strength two	2006-05-16	Paper
Data mining in bioinformatics	2005-01-20	Paper
https://portal.mardi4nfdi.de/entity/Q4833539	2004-12-15	Paper
An index structure for data mining and clustering	2003-01-08	Paper
Finding approximate patterns in undirected acyclic graphs	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	2002-06-23	Paper
MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling	2000-06-21	Paper
ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS	1996-11-26	Paper
$\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems	1996-03-18	Paper
https://portal.mardi4nfdi.de/entity/Q4854014	1995-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q4839150	1995-07-16	Paper
Approximate Tree Matching in the Presence of Variable Length Don′t Cares	1995-01-02	Paper
\(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half	1993-10-10	Paper
On the editing distance between unordered labeled trees	1993-01-16	Paper
Concurrent search structure algorithms	1992-06-25	Paper
Fast algorithms for the unit cost editing distance between trees	1990-01-01	Paper
Simple Fast Algorithms for the Editing Distance between Trees and Related Problems	1989-01-01	Paper

Research outcomes over time

This page was built for person: Dennis Shasha