5.2k citations
- Courant Institute of Mathematical SciencesUS5 papers
- University of Illinois Urbana-ChampaignUS4 papers
- New York UniversityUS3 papers
- Bharathidasan UniversityIN2 papers
- Columbia UniversityUS2 papers
- Cornell UniversityUS2 papers
- Laboratory for Atmospheric and Space PhysicsUS2 papers
- Massachusetts Institute of TechnologyUS2 papers
- Microsoft Research (India)IN2 papers
- Tel Aviv UniversityIL2 papers
- The University of TokyoJP2 papers
- University of California, DavisUS2 papers
12 papers · 1 filter
Open Graphs and Monoidal Theories
Lucas Dixon, Aleks Kissinger
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of…
Inner Product Spaces for MinSum Coordination Mechanisms
Richard Cole, José R. Correa, Vasilis Gkatzelis +2
We study policies aiming to minimize the weighted sum of completion times of jobs in the context of coordination mechanisms for selfish scheduling problems. Our goal is to design l…
Approximability of Capacitated Network Design
Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna +1
In the {\em capacitated} survivable network design problem (Cap-SNDP), we are given an undirected multi-graph where each edge has a capacity and a cost. The goal is to find a minim…
The emergence of a coherent structure for coherent structures: localized states in nonlinear systems
Jonathan Dawes
Coherent structures emerge from the dynamics of many kinds of dissipative, externally driven, nonlinear systems, and continue to provoke new questions that challenge our physical a…
Approximation Schemes for Sequential Posted Pricing in Multi-Unit Auctions
Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha +2
We design algorithms for computing approximately revenue-maximizing {\em sequential posted-pricing mechanisms (SPM)} in -unit auctions, in a standard Bayesian model. A seller ha…
Enumerating Galois representations in Sage
Craig Citro, Alexandru Ghitza
We present an algorithm for enumerating all odd semisimple two-dimensional mod p Galois representations unramified outside p. We also discuss the implementation of this algorithm i…