International audienceWe show that the shallow packing lemma follows from a simple modification of the standard proof, due to Haussler and simplified by Chazelle, of the packing lemma
Two models of proofs of lower bounds on the complexity are introduced. They have very wide applicabi...
AbstractA strengthened form of the pumping lemma for context-free languages is used to give a simple...
We provide a full self-contained proof of a famous Lemma of Ilmanen. This proof is based on a regula...
International audienceWe show that the shallow packing lemma follows from a simple modification of t...
International audienceThe packing lemma of Haussler states that given a set system $(X, R)$ with bou...
The packing lemma of Haussler states that given a set system (X,R) with bounded VC dimension, if eve...
International audienceWe refine the bound on the packing number, originally shown by Haussler, for s...
International audienceGiven a set system (X,R) such that every pair of sets in R have large symmetri...
We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set s...
Local algorithms Local algorithm: output of a node is a function of input within its constant-radius...
The entropy compression method is an algorithmic technique that was invented by Moser and Tardos in ...
We provide a novel proof of Sperner’s Lemma that is intuitive and elementary if certain simple prope...
Abstract—Until this work, the packing radius of a poset code was only known in the cases where the p...
We provide a novel proof of Sperner's Lemma that is intuitive and elementary if certain simple prope...
We prove a "general shrinking lemma" that resembles the Schwarz-Pick-Ahlfors Lemma and its...
Two models of proofs of lower bounds on the complexity are introduced. They have very wide applicabi...
AbstractA strengthened form of the pumping lemma for context-free languages is used to give a simple...
We provide a full self-contained proof of a famous Lemma of Ilmanen. This proof is based on a regula...
International audienceWe show that the shallow packing lemma follows from a simple modification of t...
International audienceThe packing lemma of Haussler states that given a set system $(X, R)$ with bou...
The packing lemma of Haussler states that given a set system (X,R) with bounded VC dimension, if eve...
International audienceWe refine the bound on the packing number, originally shown by Haussler, for s...
International audienceGiven a set system (X,R) such that every pair of sets in R have large symmetri...
We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set s...
Local algorithms Local algorithm: output of a node is a function of input within its constant-radius...
The entropy compression method is an algorithmic technique that was invented by Moser and Tardos in ...
We provide a novel proof of Sperner’s Lemma that is intuitive and elementary if certain simple prope...
Abstract—Until this work, the packing radius of a poset code was only known in the cases where the p...
We provide a novel proof of Sperner's Lemma that is intuitive and elementary if certain simple prope...
We prove a "general shrinking lemma" that resembles the Schwarz-Pick-Ahlfors Lemma and its...
Two models of proofs of lower bounds on the complexity are introduced. They have very wide applicabi...
AbstractA strengthened form of the pumping lemma for context-free languages is used to give a simple...
We provide a full self-contained proof of a famous Lemma of Ilmanen. This proof is based on a regula...
DOI
Add to ORKG