Sciweavers

6608 search results - page 1267 / 1322
» On the Completeness of Model Checking
Sort
View
131
Voted
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
16 years 3 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
136
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 3 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
137
Voted
PODS
2002
ACM
167views Database» more  PODS 2002»
16 years 3 months ago
OLAP Dimension Constraints
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
Carlos A. Hurtado, Alberto O. Mendelzon
125
Voted
ICS
2010
Tsinghua U.
16 years 28 days ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
EUROSYS
2009
ACM
16 years 19 days ago
Migrating server storage to SSDs: analysis of tradeoffs
Recently, flash-based solid-state drives (SSDs) have become standard options for laptop and desktop storage, but their impact on enterprise server storage has not been studied. P...
Dushyanth Narayanan, Eno Thereska, Austin Donnelly...
« Prev « First page 1267 / 1322 Last » Next »