Sciweavers

77 search results - page 12 / 16
» Partiality and Nondeterminacy in Program Proofs
Sort
View
PPDP
2010
Springer
13 years 5 months ago
Equational axiomatization of call-by-name delimited control
Control operators for delimited continuations are useful in various fields such as partial evaluation, CPS translation, and representation of monadic effects. While many works in...
Yukiyoshi Kameyama, Asami Tanaka
JSC
2010
107views more  JSC 2010»
13 years 2 months ago
On the relation between Context and Sequence Unification
Both Sequence and Context Unification generalize the same problem: Word Unification. Besides that, Sequence Unification solves equations between unranked terms involving sequence ...
Temur Kutsia, Jordi Levy, Mateu Villaret
ICALP
2009
Springer
14 years 7 months ago
On Cartesian Trees and Range Minimum Queries
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
Erik D. Demaine, Gad M. Landau, Oren Weimann
FOCS
2006
IEEE
14 years 1 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko
GD
2003
Springer
14 years 17 days ago
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner