Mihalis Yannakakis - Docslib

Sign Up
Log In
Upload

Sign Up
Log In
Upload

Home
» Tags
» Mihalis Yannakakis

Mihalis Yannakakis

How Easy Is Local Search?
Conformance Testing David Lee and Mihalis Yannakakis Bell
Xi Chen: Curriculum Vitae
Lipics-ICALP-2019-0.Pdf (0.4
[Cs.DB] 22 Dec 2020 Structure and Complexity of Bag Consistency
On the Complexity of Database Queries 1 Introduction
17Th Knuth Prize: Call for Nominations
Equilibria, Fixed Points, and Complexity Classes
Some Estimated Likelihoods for Computational Complexity
Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets Vijay V
Nearly Optimal Separations Between Communication (Or Query)
NP-Hardness of Computing Circuit Complexity
Submission Data for 2020-2021 CORE Conference Ranking Process International Colloquium on Automata Languages and Programming
Arxiv:2107.10454V1 [Cs.DS] 22 Jul 2021 Objective Is to ﬁnd a Route That Is (Approximately) Positive Integer Z
Equilibria, Fixed Points, and Computational Complexity – Nevanlinna Prize Lecture
The Minimum Oracle Circuit Size Problem
Multi-Prover Quantum Merlin-Arthur Proof Systems with Small Gap
Approximately Dominating Representatives$

Top View

(Manolis) – Phd Candidate at Columbia University
On the Complexity of Nash Equilibria and Other Fixed Points
The Complexity of Complexity
Santosh S. Vempala
DATABASE and QUERY ANALYSIS TOOLS for MYSQL: EXPLOITING HYPERTREE and HYPERGRAPH DECOMPOSITIONS a Thesis Presented to the Facult
Profile of Christos Papadimitriou
A Verified Program for the Enumeration of All Maximal
Mihalis Yannakakis
On the Number of Maximal Independent Sets in a Graph 3
Text Reference
Computational Hardness of the Hylland-Zeckhauser Scheme

© 2024 Docslib.org Feedback