ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: Better upper bounds on the Füredi-Hajnal limits of permutations
Article URLs:
Alternative Article URLs:
Authors: Josef Cibulka
  • Charles University, Department of Applied Mathematics
  • Charles University, Institute for Theoretical Computer Science
  • Charles University, Faculty of Mathematics and Physics
Jan Kyncl
  • Charles University, Department of Applied Mathematics
  • Charles University, Institute for Theoretical Computer Science
  • Charles University, Faculty of Mathematics and Physics
  • Alfréd Rényi Institute of Mathematics
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/CibulkaK17
Author Comments:

Discuss this paper and its artifacts below