Home
Research Trends
Papers list
Open Access Journals
All Journals
Search in Journals
Contact us
SIAM Journal on Computing
Title
Publication Date
Language
Citations
The Isomorphism Conjecture Holds Relative to an Oracle
1996/02/01
English
Learning Behaviors of Automata from Multiplicity and Equivalence Queries
1996/12/01
English
Tight Bounds on the Complexity of the Boyer–Moore String Matching Algorithm
1994/10/01
English
$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
1995/06/01
English
Polynomial Root-Finding Algorithms and Branched Covers
1994/04/01
English
Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
1996/12/01
English
An $o(n^3 )$-Time Maximum-Flow Algorithm
1996/12/01
English
On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
1995/10/01
English
Optimal Clock Synchronization under Different Delay Assumptions
1996/04/01
English
Randomized Interpolation and Approximation of Sparse Polynomials
1995/04/01
English
A Graph-Theoretic Game and Its Application to the k-Server Problem
1995/02/01
English
Trading Space for Time in Undirected s-t Connectivity
1994/04/01
English
Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
1996/04/01
English
$\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
1995/04/01
English
Ordered and Unordered Tree Inclusion
1995/04/01
English
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
1995/04/01
English
On V-Optimal Trees
1979/11/01
English
Distributed Processor Scheduling and User Countermeasures
1981/11/01
English
On the Value of Coordination in Distributed Decision Making
1996/06/01
English
Inferring Evolutionary History From DNA Sequences
1994/08/01
English
Adaptive Pattern Matching
1995/12/01
English
A New Approach to Stable Matching Problems
1994/08/01
English
Broadcasting and Gossiping in de Bruijn Networks
1994/02/01
English
Generating Linear Extensions Fast
1994/04/01
English
An Optimal $O(\log \log N)$-Time Parallel Algorithm for Detecting all Squares in a String
1996/12/01
English
Finding k Cuts within Twice the Optimal
1995/02/01
English
Analysis of Backoff Protocols for Multiple Access Channels
1996/08/01
English
An ${\mathcal{N} \mathcal{C}}$ Algorithm for Evaluating Monotone Planar Circuits
1995/04/01
English
A Generalization of the Suffix Tree to Square Matrices, with Applications
1995/06/01
English
Computing Solutions Uniquely Collapses the Polynomial Hierarchy
1996/08/01
English
«
‹ Pervious
Next ›
»