2252 search results - page 290 / 451 » Lower Bounds for Dynamic Algorithms |
124
Voted
CIAC
2010
Springer
16 years 27 days ago
2010
Springer
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
130
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract—MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths...
132
Voted
ISAAC
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
132
Voted
FOCS
1999
IEEE
15 years 7 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
105
Voted
ICCAD
1996
IEEE
15 years 7 months ago
1996
IEEE
Based Automatic Abstraction for CTL Model Checking Woohyuk Lee Abelardo Pardo Jae-Young Jang Gary Hachtel Fabio Somenzi University of Colorado ECEN Campus Box 425 Boulder, CO, 8030...