152 search results - page 14 / 31 » Constructive Proofs of Concentration Bounds |
171
click to vote
EJC
2008
15 years 5 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...
178
click to vote
ESOP
2009
Springer
16 years 16 days ago
2009
Springer
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an amortised analysis: assigning hypothetical amount...
146
click to vote
FOSSACS
2010
Springer
16 years 18 days ago
2010
Springer
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as wor...
134
click to vote
CCCG
2010
15 years 7 months ago
2010
Let S be a set of points in the plane in general position. A triangulation of S will be called even if all the points of S have an even degree. We show how to construct a triangul...
198
click to vote
FOCS
2009
IEEE
16 years 15 days ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...