Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,294 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.
2017
2017
Hidden attractor dynamics of a novel non-equilibrium fractional-order chaotic system and its synchronisation control
Manashita Borah
,
B. K. Roy
International Conference on Intelligent Cloud…
2017
Corpus ID: 29390299
This paper presents a new fractional-order hidden strange attractor generated by a chaotic system without equilibria. The…
Expand
2016
2016
Linear-Time Recognition of Map Graphs with Outerplanar Witness
Matthias Mnich
,
Ignaz Rutter
,
Jens M. Schmidt
Scandinavian Workshop on Algorithm Theory
2016
Corpus ID: 18355705
Map graphs generalize planar graphs and were introduced by Chen, Grigni and Papadimitriou [STOC 1998, J.ACM 2002]. They showed…
Expand
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
2010
2010
Streaming Algorithms from Precision Sampling
Alexandr Andoni
,
Robert Krauthgamer
,
Krzysztof Onak
arXiv.org
2010
Corpus ID: 39862180
A technique introduced by Indyk and Woodruff [STOC 2005] has inspired several recent advances in data-stream algorithms. We show…
Expand
2010
2010
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain
Siavosh Benabbas
,
A. Magen
Conference on Integer Programming and…
2010
Corpus ID: 28629044
We show how under certain conditions one can extend constructions of integrality gaps for semidefinite relaxations into ones that…
Expand
2009
2009
Structure and Dynamics of Research Collaboration in Computer Science
C. Bird
,
Earl T. Barr
,
Andre Nash
,
Premkumar T. Devanbu
,
V. Filkov
,
Z. Su
SDM
2009
Corpus ID: 5738156
Complex systems exhibit emergent patterns of behavior at different levels of organization. Powerful network analysis methods…
Expand
2009
2009
An almost O(log k)-approximation for k-connected subgraphs
Zeev Nutov
ACM-SIAM Symposium on Discrete Algorithms
2009
Corpus ID: 15345046
We consider two cases of the Survivable Network Design (SND) problem: given a complete graph Gn = (V, En) with costs on the edges…
Expand
2009
2009
Development of a toolbox for frequency response analysis of fractional order control systems
C. Yeroğlu
,
N. Tan
European Conference on Circuit Theory and Design
2009
Corpus ID: 8749228
The paper presents development of a program in the MATLAB for the analysis of Fractional Order Control Systems (FOCS). Using this…
Expand
2008
2008
A new approach for UC security concurrent deniable authentication
Tao Feng
,
Fenghua Li
,
Jianfeng Ma
,
S. Moon
Science in China Series F: Information Sciences
2008
Corpus ID: 2651726
Deniable authentication protocols allow a sender to authenticate a message for a receiver, in a way which the receiver cannot…
Expand
2001
2001
A fiber-optic current sensor based on a differentiating Sagnac interferometer
Tingyu Wang
,
C. Luo
,
Shengxuan Zheng
IEEE Transactions on Instrumentation and…
2001
Corpus ID: 37519234
A fiber-optic current sensor (FOGS) based on a differentiating Sagnac interferometer (DSI) is demonstrated to measure high…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE