Journal• ISSN: 0163-5700
SIGACT news
Association for Computing Machinery
About: SIGACT news is an academic journal published by Association for Computing Machinery. The journal publishes majorly in the area(s): Computer science & Column (typography). It has an ISSN identifier of 0163-5700. Over the lifetime, 32 publications have been published receiving 5 citations. The journal is also known as: Special Interest Group on Automata and Computability Theory news & Special Interest Group on Algorithms and Computation Theory news.
Papers
TL;DR: The researchers have considered competitive analysis as a well-de ned and standard method to measure the performance of online algorithms.
Abstract: In the modern interactive computing era, computational problems such as scheduling, rout- ing, sequencing, and resource management are online in nature. In the online framework, at the outset, an algorithm receives and processes inputs one by one in order without the knowledge of future inputs, unlike in an offline framework, where an algorithm knows the entire input sequence at the beginning. The design of mathematical models and efficient al- gorithms for the online framework constitutes a challenging and competitive area of research in Theoretical Computer Science. The researchers have considered competitive analysis as a well-de ned and standard method to measure the performance of online algorithms.
4 citations
TL;DR: The SIGACT News Online Algorithms Column 38 discusses papers in online algorithms that appeared in 2021.
Abstract: In this column, we will discuss some papers in online algorithms that appeared in 2021. As usual, we make no claim at complete coverage here, and have instead made a selection. If we have unaccountably missed your favorite paper and you would like to write about it or about any other topic in online algorithms, please don't hesitate to contact us!
3 citations
TL;DR: A survey of derandomization can be found in this article , where the authors describe new approaches to the BPP = P conjecture from recent years, as well as new questions, algorithmic approaches, and ways of thinking.
Abstract: What's new in the world of derandomization? Questions about pseudorandomness and derandomization have been driving progress in complexity theory for many decades. In this survey we will describe new approaches to the BPP = P conjecture from recent years, as well as new questions, algorithmic approaches, and ways of thinking. For example: Do we really need pseudorandom generators for derandomization, or can we get away with weaker objects? Can we prove free lunch theorems, eliminating randomness with zero computational overhead? What hardness assumptions are necessary and sufficient for derandomization? And how do new advances in this area interact with progress in cryptography and in interactive proof systems?
2 citations
TL;DR: Researchers investigate the relationship between communication complexity and matrix parameters like rank, sign-rank, and discrepancy, exploring the structure of Boolean matrices with small or large parameters to establish the reverse direction of several communication complexity theorems and conjectures.
Abstract: Several theorems and conjectures in communication complexity state or speculate that the complexity of a matrix in a given communication model is controlled by a related analytic or algebraic matrix parameter, e.g., rank, sign-rank, discrepancy, etc. The forward direction is typically easy as the structural implications of small complexity often imply a bound on some matrix parameter. The challenge lies in establishing the reverse direction, which requires understanding the structure of Boolean matrices for which a given matrix parameter is small or large. We will discuss several research directions that align with this overarching theme.
2 citations
[...]
TL;DR: The complexity of chromatic number when restricted to graphs with either bounded genus or bounded crossing number is studied in this paper , where the complexity is defined as the complexity of the number of vertices in a graph.
Abstract: This issue's Open Problem Column is by William Gasarch, Nathan Hayes, Anthony Ostuni, and Davin Park. It is The complexity of chromatic number when restricted to graphs with either bounded genus or bounded crossing number.
1 citations
Performance Metrics
| Year | Papers |
|---|---|
| 2025 | 17 |
| 2024 | 21 |
| 2023 | 22 |
| 2022 | 16 |
| 2021 | 1 |