Sciweavers

168 search results - page 8 / 34
» Abstract Interpretation for Worst and Average Case Analysis
Sort
View
116
Voted
ISQED
2007
IEEE
152views Hardware» more  ISQED 2007»
15 years 8 months ago
Variation Aware Timing Based Placement Using Fuzzy Programming
In nanometer regime, the effects of variations are having an increasing impact on the delay and power characteristics of devices as well as the yield of the circuit. Statistical t...
Venkataraman Mahalingam, N. Ranganathan
IJFCS
2006
83views more  IJFCS 2006»
15 years 1 months ago
A Simple Alphabet-independent Fm-index
Abstract. We design a succinct full-text index based on the idea of Huffmancompressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can...
Szymon Grabowski, Gonzalo Navarro, Rafal Przywarsk...
102
Voted
STACS
2004
Springer
15 years 7 months ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
GECON
2008
Springer
152views Business» more  GECON 2008»
15 years 2 months ago
The Power of Preemption in Economic Online Markets
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
Lior Amar, Ahuva Mu'alem, Jochen Stößer
SODA
2004
ACM
76views Algorithms» more  SODA 2004»
15 years 3 months ago
A maiden analysis of Longest Wait First
We consider server scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform size. The algorithm Longest Wait First (LWF) always...
Jeff Edmonds, Kirk Pruhs