Sciweavers

876 search results - page 142 / 176
» New Results for the Martin Polynomial
Sort
View
ECCC
2010
143views more  ECCC 2010»
14 years 9 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran
OOPSLA
2007
Springer
15 years 6 months ago
Using early phase termination to eliminate load imbalances at barrier synchronization points
We present a new technique, early phase termination, for eliminating idle processors in parallel computations that use barrier synchronization. This technique simply terminates ea...
Martin C. Rinard
VMCAI
2004
Springer
15 years 5 months ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
16 years 12 days ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
15 years 6 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel