Dennis Shasha

From MaRDI portal
Person:686640

Available identifiers

zbMath Open shasha.dennis-eDBLPs/DennisShashaWikidataQ5258945 ScholiaQ5258945MaRDI QIDQ686640

List of research outcomes





PublicationDate of PublicationType
Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines2023-12-19Paper
High Performance, Low Energy, and Trustworthy Blockchains Using Satellites2023-12-19Paper
Automated Verification of Concurrent Search Structures2021-07-13Paper
Fast methods for finding significant motifs on labelled multi-relational networks2021-05-07Paper
Statistics is Easy! Second Edition2021-04-12Paper
Statistics is Easy: Case Studies on Real Scientific Datasets2021-04-12Paper
Fast analytical methods for finding significant labeled graph motifs2019-05-03Paper
Exact and approximate algorithms for unordered tree matching2017-10-09Paper
Building secure file systems out of byzantine storage2014-07-25Paper
Products of mixed covering arrays of strength two2006-05-16Paper
Data mining in bioinformatics2005-01-20Paper
https://portal.mardi4nfdi.de/entity/Q48335392004-12-15Paper
An index structure for data mining and clustering2003-01-08Paper
Finding approximate patterns in undirected acyclic graphs2002-09-29Paper
Algorithms and experience in increasing the intelligibility and hygiene of access control in large organizations2002-08-05Paper
Efficient data reconciliation2002-06-23Paper
MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling2000-06-21Paper
ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS1996-11-26Paper
$\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems1996-03-18Paper
https://portal.mardi4nfdi.de/entity/Q48540141995-11-08Paper
https://portal.mardi4nfdi.de/entity/Q48391501995-07-16Paper
Approximate Tree Matching in the Presence of Variable Length Don′t Cares1995-01-02Paper
\(B\)-trees with inserts and deletes: Why free-at-empty is better than merge-at-half1993-10-10Paper
On the editing distance between unordered labeled trees1993-01-16Paper
Concurrent search structure algorithms1992-06-25Paper
Fast algorithms for the unit cost editing distance between trees1990-01-01Paper
Simple Fast Algorithms for the Editing Distance between Trees and Related Problems1989-01-01Paper

Research outcomes over time

This page was built for person: Dennis Shasha