Christos Papadimitriou
where else to find them
no profile links on file
what they talk about
where they keep going back
- ITCS2 editions2021–2023
all 10 in the filters
on a stage with
all 5 in the filters
who talks about the same things
- Mihalis Yannakakis3 talks
- Toniann Pitassi5 talks
- Daniel Mitropolsky2 talks
- Chris Jones10 talks
- Dor Minzer8 talks
- Mark Braverman5 talks
| title | conference | date |
|---|---|---|
| What neural machinery is needed for language acquisition (Virtual Talk) | Understanding Higher-Level Intelligence from AI, Psychology, and Neuroscience Perspectives | 2024-06-24 |
A minimal neural model called NEMO postulates cortical assemblies, discrete timesteps, random sparse synapses, Hebbian updates and long-range inhibitory… | ||
| Extremal Combinatorics, iterated pigeonhole arguments, and generalizations of PPP | ITCS 2023 | 2023-01-10 |
Paper defines a two-player long choice game on 2^n pigeons whose iterated-majority argument yields class PLC; it reduces the classic pigeonhole circuit (PPP)… | ||
| Total Function Problems in the Polynomial Hierarchy | 50 Years of Satisfiability: The Centrality of SAT in the Theory of Computing | 2021-02-11 |
Defines total search problems beyond NP, locates a new union‑bound class (PEP/APEP) and proposes the circuit‑complexity construction "complexity" as the… | ||
| Total Functions in the Polynomial Hierarchy | ITCS 2021 | 2021-01-06 |
Defines a hierarchy TFΣi of total search classes and proves specific natural problems sit at low levels: the empty problem is in TFΣ2 via a union‑bound /… | ||
| Computation with Assemblies | Computational Theories of the Brain 2018 | 2018-04-16 |
Asserts an Assembly Hypothesis where synchronized, persistent neuron populations perform operations like projection, association and merge; projection creates… | ||
| Theory of Computation I | The Brain and Computation Boot Camp | 2018-01-16 |
Overview mixes history and concrete results: 1936 Turing machine definition and the proof that some simple problems are unsolvable; von Neumann’s 1946… | ||
| Theory of Computation II | The Brain and Computation Boot Camp | 2018-01-16 |
Perceptron learning gets a provable mistake bound of one over margin squared and becomes practical via the kernel trick that maps nonlinearly separable data… | ||
| AGT and Machine Learning | Algorithmic Game Theory and Practice 2015 | 2015-11-16 |
Three concrete results: strategic classification models data as a Stackelberg game and proves that with a separable cost (or min of few separable functions) a… | ||
| Complexity in AGT Update: Nash Approximability and Simultaneous Auctions | Complexity and Simplicity in Economics (Simons Institute workshop, 2015) | 2015-10-12 |
Christos Papadimitriou, UC Berkeley
Complexity and Simplicity in Economics
https://simons.berkeley.edu/talks/christos-papadimitriou-10-14 | ||
| On Algorithmic Game Theory I | Economics and Computation Boot Camp 2015 | 2015-08-24 |
A brisk history of algorithmic game theory traces pre-’95 links to TCS and Herbert Simon’s bounded rationality, then shifts to concrete complexity results… | ||
| On Algorithmic Game Theory II | Economics and Computation Boot Camp 2015 | 2015-08-24 |
Survey of current problems: internet research concentrates on ad auctions, BGP and net neutrality, and cloud economics with no neat theoretical consensus; a… | ||
| Presentation of Evolution and Algorithms | Computational Theories of Evolution | 2014-03-17 |
Shows that standard population genetics under weak selection implements the multiplicative weights update: allele frequencies follow the MW equations, so… | ||
| Evolution and Computation | Symposium on Visions of the Theory of Computing 2013 | 2013-05-29 |
Claim: under weak selection classical Fisher‑Wright population genetics is equivalent to a repeated game run by genes using the multiplicative weights update… | ||
| nothing matches | ||