No. Title Author Year
1 Extremal Combinatorics, Iterated Pigeonhole Arguments and Generalizations of PPP Pasarkar, Amol et al. 2023
2 Algorithmic Game Theory and the Internet (Dagstuhl Seminar 03291) Karpinski, Marek et al. 2021
3 Total Functions in the Polynomial Hierarchy Kleinberg, Robert et al. 2021
4 Tarski’s Theorem, Supermodular Games, and the Complexity of Equilibria Etessami, Kousha et al. 2020
5 Wealth Inequality and the Price of Anarchy Gemici, Kurtulus et al. 2019
6 Long Term Memory and the Densest K-Subgraph Problem Legenstein, Robert et al. 2018
7 Random Projection in the Brain and Computation with Assemblies of Neurons Papadimitriou, Christos H. et al. 2018
8 Towards a Unified Complexity Theory of Total Functions Goldberg, Paul W. et al. 2018
9 Front Matter, Table of Contents, Preface, Conference Organization Papadimitriou, Christos H. 2017
10 LIPIcs, Volume 67, ITCS'17, Complete Volume Papadimitriou, Christos H. 2017
11 On Satisfiability Problems with a Linear Structure Gaspers, Serge et al. 2017
12 Computation as a Scientific Weltanschauung (Invited Talk) Papadimitriou, Christos H. 2016
13 Algorithms, Games, and Evolution (Invited Talk) Chastain, Erick et al. 2014
Current Page :
Number of result pages: 1
Number of documents: 13


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI