11214 search results - page 2150 / 2243 » Just-in-time data structures |
111
click to vote
POPL
2010
ACM
15 years 8 months ago
2010
ACM
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
POPL
2010
ACM
15 years 8 months ago
2010
ACM
The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the...
121
click to vote
SODA
2010
ACM
15 years 8 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
PPOPP
2010
ACM
15 years 8 months ago
2010
ACM
Drawing inspiration from several previous projects, we present an ownership-record-free software transactional memory (STM) system that combines extremely low overhead with unusua...
SPAA
2009
ACM
15 years 8 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...