SIAM Journal on Computing

The SIAM Journal on Computing is a scientific journal focusing on the mathematical and formal aspects of computer science. It is published by the Society for Industrial and Applied Mathematics (SIAM). Although its official ISO abbreviation is SIAM J. Comput., its publisher and contributors frequently use the shorter abbreviation SICOMP. SICOMP typically hosts the special issues of the IEEE Annual Symposium on Foundations of Computer Science (FOCS) and the Annual ACM Symposium on Theory of Computing (STOC), where about 15% of papers published in FOCS and STOC each year are invited to these special issues. For example, Volume 48 contains 11 out of 85 papers published in FOCS 2016. Source: Wikipedia (en)

Editions published in SIAM Journal on Computing 563

Depth-First Search and Linear Graph Algorithms
A Minimum Distance Error-Correcting Parser for Context-Free Languages
On Languages Accepted in Polynomial Time
The Transitive Reduction of a Directed Graph
A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
Dividing a Graph into Triconnected Components
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Set Merging Algorithms
Binary Search Trees of Bounded Balance
Enumeration of the Elementary Circuits of a Directed Graph
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
Computationally Related Problems
Relativizations of the 𝒫 =? 𝒩𝒫 Question
On Finding and Updating Spanning Trees and Shortest Paths
Network Flow and Testing Graph Connectivity
Complexity Results for Multiprocessor Scheduling under Resource Constraints
Bounds for Multiprocessor Scheduling with Resource Constraints
On the Number of Multiplications/Divisions Evaluating a Polynomial with Auxiliary Functions
On the Complexity of Timetable and Multicommodity Flow Problems
Algorithmic Aspects of Vertex Elimination on Graphs
Finding Minimum Spanning Trees
A Powerdomain Construction
Multidimensional Searching Problems
Fast Parallel Matrix Inversion Algorithms
Scheduling Graphs on Two Processors
On the Number of Multiplications Required for Matrix Multiplication
On Relating Time and Space to Size and Depth
Fast Pattern Matching in Strings
On Isomorphisms and Density of $NP$ and Other Complete Sets
An Analysis of Several Heuristics for the Traveling Salesman Problem
Two Algorithms for Generating Weighted Spanning Trees in Order
Fast Algorithms for Partial Fraction Decomposition

Subject -

Welcome to inventaire

The library of your friends and communities

Learn more

Subject