226 citations
- D. Boscherini2 profiles22 · h 111
- M. Przybycień21
- A. Eskreys2 profiles20 · h 44
- E. Paul2 profiles20 · h 40
- F. Cindolo2 profiles20 · h 100
- G. Bruni2 profiles20 · h 105
- L. Zawiejski2 profiles20 · h 39
- S. Kitamura2 profiles20 · h 36
- U. Schneekloth2 profiles19 · h 44
- L. Stanco2 profiles18 · h 72
- D. Bailey16
- G. Drews14
- University of TorontoCA33 papers
- Rutherford Appleton LaboratoryGB32 papers
- Tel Aviv UniversityIL32 papers
- University of FreiburgDE32 papers
- University of OxfordGB32 papers
- Sapienza University of RomeIT31 papers
- The Ohio State UniversityUS31 papers
- University College LondonGB31 papers
- University of AmsterdamNL31 papers
- University of BonnDE31 papers
- University of GlasgowGB31 papers
- Weizmann Institute of ScienceIL31 papers
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2009★ 12 cited
A certifying algorithm for 3-colorability of P5-free graphs
Daniel Bruce, Chinh T. Hoang, Joe Sawada
We provide a certifying algorithm for the problem of deciding whether a P5- free graph is 3-colorable by showing there are exactly six finite graphs that are P5-free and not 3-colo…
cs.DM2003★ 13 cited
The Boolean Functions Computed by Random Boolean Formulas OR How to Grow the Right Function
Alex Brodsky, Nicholas Pippenger
Among their many uses, growth processes (probabilistic amplification), were used for constructing reliable networks from unreliable components, and deriving complexity bounds of va…