Write in a clean editor, then format for ACM SIGACT News in one click — DocuGuru applies the official ACM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
ACM SIGACT News is a peer-reviewed journal published by ACM, covering Computability, Logic, AI Algorithms, Complexity and Algorithms in Graphs, Distributed systems and fault tolerance.
| Publisher | ACM |
|---|---|
| Reference style | Numbered (ACM) Numbered — [1], [2] in the text [1] Ada Smith, Ben Jones, and Cara Lee. 2023. A representative article title. ACM SIGACT News 12, 3, Article 45 (2023).
Formats any DOI in ACM SIGACT News style. No sign-up. |
| Publishes research in | Computability, Logic, AI Algorithms Complexity and Algorithms in Graphs Distributed systems and fault tolerance Optimization and Search Problems Algorithms and Data Compression |
| ISSN | 0163-5700 |
| Citation impact (2-yr) | 0.16 |
| h-index | 72 |
| i10-index | 274 |
| Total citations | 28,002 |
| Top institutions publishing here | University of Rochester |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Approximation algorithms have developed in response to the impossibility of solving a great variety of important optimization problems. Too frequently, when attempting to get a solution for a problem, one is confronted with the fact that the problem is NP-hard. This, in the words of Garey and Johnson, means "I can't find an efficient algorithm,…
"Michael Sipser's philosophy in writing this book is simple: make the subject interesting and relevant, and the students will learn. His emphasis on unifying computer science theory - rather than offering a collection of low-level details - sets the book apart, as do his intuitive explanations. Throughout the book, Sipser - a noted authority on…
When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all three. In this note, we prove this conjecture in the asynchronous network model, and then discuss solutions to this dilemma in the partially synchronous model.
article Conjugate coding Share on Author: Stephen Wiesner Columbia University, New York, N.Y. Columbia University, New York, N.Y.View Profile Authors Info & Claims ACM SIGACT NewsVolume 15Issue 1Winter-Spring 1983 pp 78–88https://doi.org/10.1145/1008908.1008920Online:01 January 1983Publication History 753citation4,598DownloadsMetricsTotal Citations753Total Downloads4,598Last 12 Months464Last 6 weeks47 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be…
This book is an introduction, on the undergraduate level, to the classical and contemporary theor y of computation . The topics covered are, in a few words, the theory of automata and formal languages, computability by Turing machines and recursive functions, uncomputability, computationa l complexity, and mathematical logic . The treatment is mathematical but the…
ACM Transactions on Economics and Computation
ACM Transactions on Evolutionary Learning and Optimization
ACM Transactions on Human-Robot Interaction
ACM Transactions on Intelligent Systems and Technology
ACM Transactions on Internet of Things
ACM Transactions on Knowledge Discovery from Data
ACM Transactions on Mathematical Software
ACM Transactions on Modeling and Performance Evaluation of Computing Systems
