Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,554,475 papers from all fields of science
Search
Sign In
Create Free Account
ACM SIGACT
Known as:
ACM SIGACT News
, SIGACT
, Special Interest Group on Algorithms and Computation Theory
Expand
ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Dominating set
Gödel Prize
ICALP
Knuth Prize
Expand
Broader (1)
Theoretical computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
SIGACT news online algorithms column 20: the power of harmony
R. V. Stee
SIGA
2012
Corpus ID: 14805804
I would like to begin this column by thanking Marek Chrobak, Lance Fortnow and Brendan Mumey for giving me this opportunity for…
Expand
2011
2011
Automating the design flow for distributed embedded automotive applications: Keeping your time promises, and optimizing costs, too
Matthias Büker
,
W. Damm
,
Günter Ehmen
,
Alexander Metzner
,
Ingo Stierand
,
E. Thaden
6th IEEE International Symposium on Industrial…
2011
Corpus ID: 18295882
We address the complete design flow from specification models of new automotive functions captured in Matlab-Simulink to their…
Expand
Review
2009
Review
2009
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Zhong Shao
,
B. Pierce
ACM-SIGACT Symposium on Principles of Programming…
2009
Corpus ID: 59698536
Welcome to the Thirty-Sixth Symposium on Principles of Programming Languages, held Wednesday, January 21st, through Friday…
Expand
2009
2009
Representing human and machine dictionaries in Markup languages
L. Lemnitzer
,
Laurent Romary
,
A. Witt
arXiv.org
2009
Corpus ID: 14981387
In this chapter we present the main issues in representing machine readable dictionaries in XML, and in particular according to…
Expand
2006
2006
Open-Source Model Checking
R. Grosu
,
Xiaowan Huang
,
Sumit Jain
,
S. Smolka
SoftMC@CAV
2006
Corpus ID: 18906330
Review
2005
Review
2005
Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, Long Beach, California, USA, January 12-14, 2005
J. Palsberg
,
M. Abadi
ACM-SIGACT Symposium on Principles of Programming…
2005
Corpus ID: 31502468
This volume contains the papers presented at POPL'05, The Thirty-Second Annual ACM SIGPLAN-SIGACT Symposium on Principles of…
Expand
Review
2003
Review
2003
Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A. Aiken
,
Greg Morrisett
ACM-SIGACT Symposium on Principles of Programming…
2003
Corpus ID: 59780744
This volume contains the papers and abstracts presented at POPL'03, the Thirtieth Annual ACM SIGPLAN-SIGACT Symposium on…
Expand
2003
2003
An Improved On-The-Fly Tableau Construction for a Real-Time Temporal Logic
M. Geilen
International Conference on Computer Aided…
2003
Corpus ID: 18400195
Temporal logic is popular for specifying correctness properties of reactive systems. Real-time temporal logics add the ability to…
Expand
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Robert H. B. Netzer
International Workshop on Languages and Compilers…
1993
Corpus ID: 10717466
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly…
Expand
1980
1980
Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
P. Abrahams
,
R. Lipton
,
S. Bourne
ACM-SIGACT Symposium on Principles of Programming…
1980
Corpus ID: 61750067
The papers in this volume were presented at the Eighth Annual ACM Symposium on Principals of Programming Languages, sponsored…
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