output
20022015
most citedA versatile and accurate approximation for LRU cache performance

265 citations

researchers with a paper here
collaborating institutions
Showing 2014Show all

2 papers · 1 filter

math.PR2014

Cutting down -trees and inhomogeneous continuum random trees

Nicolas Broutin, Minmin Wang

We study a fragmentation of the -trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1--18, 2000]. We give exact correspondences between the -trees an…

cs.DM2014★ 11 cited

Graphs with large chromatic number induce -cycles

Marthe Bonamy, Pierre Charbit, Stéphan Thomassé

Answering a question of Kalai and Meshulam, we prove that graphs without induced cycles of length have bounded chromatic number. This implies the very first case of a much bro…