2372 search results - page 474 / 475 » is 2012 |
117
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
140
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
114
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
113
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We study the role that parallelism plays in time complexariants of Winfree’s abstract Tile Assembly Model (aTAM), a model of molecular algorithmic self-assembly. In the “hiera...
111
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...