Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,451,123 papers from all fields of science
Search
Sign In
Create Free Account
Symposium on Foundations of Computer Science
Known as:
Annual IEEE Symposium on Foundations of Computer Science
, FOCS
, IEEE Symposium on Foundations of Computer Science
Expand
FOCS, the Annual IEEE Symposium on Foundations of Computer Science, is an academic conference in the field of theoretical computer science. FOCS is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
42 relations
ACM SIGACT
Aanderaa–Karp–Rosenberg conjecture
Anna Karlin
Apex graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria
Matthias Feldotto
,
Martin Gairing
,
Alexander Skopalik
Workshop on Internet and Network Economics
2014
Corpus ID: 9594975
In this paper we study the potential function in congestion games. We consider both games with non-decreasing cost functions as…
Expand
2014
2014
Optimal Tourist Problem and Anytime Planning of Trip Itineraries
Jingjin Yu
,
J. Aslam
,
S. Karaman
,
D. Rus
arXiv.org
2014
Corpus ID: 2352653
We introduce and study the problem in which a mobile sensing robot (our tourist) is tasked to travel among and gather…
Expand
2014
2014
A subexponential parameterized algorithm for Interval Completion
Ivan A. Bliznets
,
F. Fomin
,
Marcin Pilipczuk
,
Michał Pilipczuk
arXiv.org
2014
Corpus ID: 260548311
In the Interval Completion problem we are given a graph G and an integer k, and the task is to turn G using at most k edge…
Expand
2014
2014
Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions
G. Varma
Chicago journal of theoretical computer science
2014
Corpus ID: 15902058
In a recent result, Khot and Saket [FOCS 2014] proved the quasi-NP-hardness of coloring a 2-colorable 12-uniform hypergraph with…
Expand
2013
2013
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
V. Guruswami
,
P. Harsha
,
J. Håstad
,
S. Srinivasan
,
G. Varma
Symposium on the Theory of Computing
2013
Corpus ID: 456586
We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the"short code" of…
Expand
2008
2008
When and How Can Data be Efficiently Released with Privacy ?
C. Dwork
,
M. Naor
,
Omer Reingold
,
G. Rothblum
,
S. Vadhan
2008
Corpus ID: 7005668
We consider private data analysis in the setting in which a trusted and trustworthy curator, having obtained a large data set…
Expand
2008
2008
Impact of Information on the Complexity of Asynchronous Radio Broadcasting
T. Calamoneri
,
Emanuele G. Fusco
,
A. Pelc
International Conference on Principles of…
2008
Corpus ID: 15803144
We consider asynchronous deterministic broadcasting in radio networks. An execution of a broadcasting protocol is a series of…
Expand
2008
2008
Special Issue on Foundations of Computer Science
Irit Dinur
,
É. Tardos
SIAM journal on computing (Print)
2008
Corpus ID: 38427948
This volume comprises the polished and fully refereed versions of a selection of papers presented at the Forty-Sixth Annual IEEE…
Expand
2008
2008
Parameterized Algorithms for Partial Cover Problems
O. Amini
,
F. Fomin
,
Saket Saurabh
arXiv.org
2008
Corpus ID: 11850351
Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input…
Expand
1995
1995
Output-sensitive construction of convex hulls
Timothy M. Chan
1995
Corpus ID: 120475045
The construction of the convex hull of a nite point set in a low-dimensional Euclidean space is a fundamental problem in…
Expand