Sciweavers

CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
13 years 10 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
SIGCSE
2004
ACM
110views Education» more  SIGCSE 2004»
13 years 10 months ago
An extensible framework for providing dynamic data structure visualizations in a lightweight IDE
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
T. Dean Hendrix, James H. Cross II, Larry A. Barow...
SPIRE
2005
Springer
13 years 10 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi
ICTAC
2005
Springer
13 years 10 months ago
Covarieties of Coalgebras: Comonads and Coequations
Coalgebras provide effective models of data structures and state-transition systems. A virtual covariety is a class of coalgebras closed under coproducts, images of coalgebraic mo...
Ranald Clouston, Robert Goldblatt
FMCO
2005
Springer
153views Formal Methods» more  FMCO 2005»
13 years 10 months ago
Smallfoot: Modular Automatic Assertion Checking with Separation Logic
Abstract. Separation logic is a program logic for reasoning about programs that manipulate pointer data structures. We describe Smallfoot, a tool for checking certain lightweight s...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
CC
2005
Springer
120views System Software» more  CC 2005»
13 years 10 months ago
Data Slicing: Separating the Heap into Independent Regions
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
Jeremy Condit, George C. Necula
TLDI
2005
ACM
135views Formal Methods» more  TLDI 2005»
13 years 10 months ago
Types for describing coordinated data structures
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
Michael F. Ringenburg, Dan Grossman
SIGCSE
2005
ACM
217views Education» more  SIGCSE 2005»
13 years 10 months ago
Alternatives to two classic data structures
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives ...
Chris Okasaki
SWSTE
2005
IEEE
13 years 10 months ago
Mapping Structures for Flash Memories: Techniques and Open Problems
Flash memory is a type of electrically erasable programmable read-only memory (EEPROM). Because flash memories are nonvolatile and relatively dense, they are now used to store ...
Eran Gal, Sivan Toledo
ICDCSW
2005
IEEE
13 years 10 months ago
DistScroll - A New One-Handed Interaction Device
We present an interaction device for navigating data structures or browsing menus using only one hand. It is especially designed for situations in which the user wears gloves that...
Matthias Kranz, Paul Holleis, Albrecht Schmidt