1 citations
- 3C InstituteUS1 paper
- Carnegie Mellon UniversityUS1 paper
- Center for Integrated NanotechnologiesUS1 paper
- Complexity and Topology in Quantum MatterDE1 paper
- Computer Algorithms for MedicineAT1 paper
- Crystal Research (United States)US1 paper
- Dimensional Imaging (United Kingdom)GB1 paper
- FZU ‒ Institute of Physics of the Academy of Sciences of the Czech RepublicCZ1 paper
- Institute of Photonic SciencesES1 paper
- Laboratoire de Recherche en InformatiqueFR1 paper
- Lawrence Berkeley National LaboratoryUS1 paper
- Office National de la MétéorologieDZ1 paper
4 papers
Consensus Time in 3-Majority and 2-Choices Is Determined by the Maximum Initial Opinion Density
Niccolò D Archivio
We establish the correct parameter governing the convergence time of the 3-Majority and 2-Choices dynamics on the complete graph in the synchronous model. Recent work [Shimizu and…
Structured vs. Unstructured Pruning: An Exponential Gap
Davide Ferre', Frédéric Giroire, Frederik Mallmann-Trenn +1
The Strong Lottery Ticket Hypothesis (SLTH) states that large, randomly initialized neural networks contain sparse subnetworks capable of approximating a target function at initial…
Photo-physics and electronic structure of lateral graphene/MoS2 and metal/MoS2 junctions
Shruti Subramanian, Quinn T. Campbell, Simon Moser +18
Integration of semiconducting transition metal dichalcogenides (TMDs) into functional optoelectronic circuitries requires an understanding of the charge transfer across the interfa…
Complexity Dichotomies for the Minimum F-Overlay Problem
Nathann Cohen, Frédéric Havet, Dorian Mazauric +2
For a (possibly infinite) fixed family of graphs F, we say that a graph G overlays F on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of…