2019 search results - page 73 / 404 » Programming with Shared Data Abstractions |
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
PADL
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Interactive programming is a method for implementing programming languages that supports an interactive, exploratory style of program development and debugging. The basic...
SAS
2007
Springer
14 years 1 months ago
2007
Springer
We present a new pointer analysis for use in shared memory programs running on hierarchical parallel machines. The analysis is motivated by the partitioned global address space lan...
ICALP
2003
Springer
14 years 28 days ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
PLDI
2012
ACM
11 years 10 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...