vix.ing · top · new · best · stats · spec

Feuilloley, Laurent

  1. Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line : Algorithms and Complexity
    2013/09/25 by Correa, José R., Feuilloley, Laurent, Pérez-Lantero, Pablo +1 · 2 citations
    #Computational Geometry (cs.CG) #FOS: Computer and information sciences
  2. Compact Distributed Certification of Planar Graphs
    2020/05/12 by Feuilloley, Laurent, Fraigniaud, Pierre, Rapaport, Ivan +3 · 2 citations
    #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  3. Local Certification of Graphs with Bounded Genus
    2020/07/16 by Laurent Feuilloley, Feuilloley, Laurent, Pierre Fraigniaud +9 · 2 citations
    Computer Science · Social Sciences · #Cryptography and Data Security #Distributed systems and fault tolerance #Access Control and Trust
  4. The Secretary Problem with Independent Sampling
    2020/11/16 by José Correa, Correa, José, Andrés Cristi +7 · 2 citations
    Computer Science · Medicine · #60G40 (Primary) #91A60 (Secondary) #Computer Science and Game Theory (cs.GT) #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Head and Neck Surgical Oncology #Optimization and Search Problems
  5. How Long It Takes for an Ordinary Node with an Ordinary ID to Output?
    2017/04/19 by Laurent Feuilloley, Feuilloley, Laurent · 1 citation
    Computer Science · #Complexity and Algorithms in Graphs #Distributed #Distributed systems and fault tolerance #FOS: Computer and information sciences #Optimization and Search Problems #Parallel #and Cluster Computing (cs.DC)
  6. Redundancy in Distributed Proofs
    2018/03/08 by Feuilloley, Laurent, Fraigniaud, Pierre, Hirvonen, Juho +2 · 1 citation
    #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  7. Local verification of global proofs
    2018/03/26 by Feuilloley, Laurent, Hirvonen, Juho · 1 citation
    #Distributed #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Parallel #and Cluster Computing (cs.DC)
  8. What can be certified compactly?
    2022/02/12 by Nicolás Bousquet, Laurent Feuilloley, Bousquet, Nicolas +3 · 1 citation
    Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Cryptography and Data Security #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  9. Graph classes and forbidden patterns on three vertices
    2018/12/14 by Feuilloley, Laurent, Habib, Michel · 1 citation
    #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
  10. Local certification of local properties: tight bounds, trade-offs and new parameters
    2023/12/21 by Bousquet, Nicolas, Feuilloley, Laurent, Zeitoun, Sébastien · 1 citation
    #Discrete Mathematics (cs.DM) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)
  11. Complexity landscape for local certification
    2025/05/27 by Bousquet, Nicolas, Feuilloley, Laurent, Zeitoun, Sébastien · 2 citations
    #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Distributed #FOS: Computer and information sciences #Parallel #and Cluster Computing (cs.DC)