BDD Algortihms and Cache Misses (1996)

by Nils Klarlund , Theis Rauhe , Nils Klarlund , Theis Rauhe
Citations:2 - 0 self

Documents Related by Co-Citation

4 Arge. The I/O-Complexity of Ordered BinaryDecision Diagram Manipulation – RS-96-29 Lars - 1996
4 RS-96-25 Devdatt Dubhashi and Desh Ranjan. Balls and Bins: A Study in Negative Dependence – Kim G Larsen Jensen, Arne Skou - 1996
149 The buffer tree: A new technique for optimal I/O-algorithms – Lars Arge - 1995
1 The Buffer Tree: ANewTechnique for Optimal I/O Algorithms – RS-96-28 Lars Arge - 1996
2 Hash functions for priority queues, Information and Computation 63:217–225 – M Ajtai, M L Fredman, J Komlos - 1984
31 Decision trees and random access machines – W Paul, J Simon - 1980
10 Organization and maintenance of large ordered indexes. Acta Informatica 1:173–189 – R Bayer, E McCreight - 1972
145 Surpassing the information theoretic bound with fusion trees – M L Fredman, D E Willard - 1993
36 Optimal algorithms for list indexing and subset rank – P F Dietz - 1989
3 Towards automata for branching time and partial order – M Huhn, P - 1996
2 Ramanujam and P.S. Thiagarajan: A – K Lodaya, R Parikh, R - 1995
14 Keeping track of the latest gossip: Bounded time-stamps suffice – M Mukund, M Sohoni - 1993
1 Thiagarajan: Event Structures and Trace – B Rozoy, P S - 1991
1 Private communication – I Walukiewicz
10 Traces and logic – W Penczek, R Kuiper - 1995
10 Relations: Practical Ways to Reason about `new – Equations Names - 1996
3 Trace Structures and other Models for Concurrency – M Nielsen, G Winskel - 1995
1 Diekert and A. Muscholl: Deterministic Asynchronous Automata for Infinite Traces – V - 1994
1 Ramanujam and P.S. Thiagarajan: A Logical Study of Distributed Transition Systems – K Lodaya, R Parikh, R - 1995