output
19922026
most citedObservation of a new particle in the search for the Standard Model Higgs boson with the ATLAS detector at the LHC

10.9k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2003 · math.COShow all

5 papers · 2 filters

math.CO2003

Expected length of the longest common subsequence for large alphabets

Marcos Kiwi, Martin Loebl, Jiri Matousek

We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield…

math.CO2003

On the least exponential growth admitting uncountably many closed permutation classes

Martin Klazar

We show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2^n and (2.33529...)^n.

math.CO2003★ 1 cited

Extremal problems for ordered hypergraphs: small patterns and some enumeration

Martin Klazar

We investigate extremal functions ex_e(F,n) and ex_i(F,n) counting maximum numbers of edges and maximum numbers of vertex-edge incidences in simple hypergraphs H which have n verti…

math.CO2003★ 1 cited

Extremal problems for ordered (hyper)graphs: applications of Davenport-Schinzel sequences

Martin Klazar

We introduce a containment relation of hypergraphs which respects linear orderings of vertices and investigate associated extremal functions. We extend, by means of a more generall…

math.CO2003★ 75 cited

The enumeration of simple permutations

M. H. Albert, M. D. Atkinson, M. Klazar

A simple permutation is one which maps no proper non-singleton interval onto an interval. We consider the enumeration of simple permutations from several aspects. Our results inclu…