Sciweavers

Share
TCS
2010
9 years 5 months ago
The relevant prefixes of coloured Motzkin walks: An average case analysis
In this paper we study some relevant prefixes of coloured Motzkin walks (otherwise called coloured Motzkin words). In these walks, the three kinds of step can have , and colours...
Donatella Merlini, Renzo Sprugnoli
DAM
2008
81views more  DAM 2008»
9 years 10 months ago
Random-order bin packing
ct The average case analysis of algorithms usually assumes independent, identical distributions for the inputs. In [?], Kenyon introduced the random-order ratio, a new average case...
Edward G. Coffman Jr., János Csirik, Lajos ...
AMC
2007
108views more  AMC 2007»
9 years 10 months ago
How robust are average complexity measures? A statistical case study
: Average case analysis forms an interesting and intriguing part of algorithm theory since it explains why some algorithms with bad worst-case complexity can better themselves in p...
Soubhik Chakraborty, Suman Kumar Sourabh
BIRTHDAY
2006
Springer
10 years 2 months ago
Abstract Interpretation for Worst and Average Case Analysis
Interpretation for Worst and Average Case Analysis Alessandra Di Pierro1 , Chris Hankin2 , and Herbert Wiklicky2 1 Dipartimento di Informatica, University of Pisa, Italy 2 Departme...
Alessandra Di Pierro, Chris Hankin, Herbert Wiklic...
STACS
2004
Springer
10 years 3 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...
books