Home
Research Trends
Papers list
Open Access Journals
All Journals
Search in Journals
Contact us
SIAM Journal on Computing
Title
Publication Date
Language
Citations
An $O(N + M)$-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph
1996/04/01
English
Approximate Max-Flow on Small Depth Networks
1995/06/01
English
Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
1994/12/01
English
Digital Search Trees Again Revisited: The Internal Path Length Perspective
1994/06/01
English
A Variational Method for Analysing Unit Clause Search
1995/06/01
English
Finding k Disjoint Paths in a Directed Planar Graph
1994/08/01
English
On the Reuse of Additions in Matrix Multiplication
1995/12/01
English
Computational Complexity of Two-Dimensional Regions
1995/10/01
English
The Complexity of Decision Versus Search
1994/02/01
English
A new Characterization of Type-2 Feasibility
1996/02/01
English
New Resultant Inequalities and Complex Polynomial Factorization
1994/10/01
English
Closeness of NP-Hard Sets to Other Complexity Classes
1994/04/01
English
Planar Strong Connectivity Helps in Parallel Depth-First Search
1995/02/01
English
With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets
1995/10/01
English
Constructing Huffman Trees in Parallel
1995/12/01
English
Easily Checked Generalized Self-Reducibility
1995/08/01
English
Convergence in Distribution for Best-Fit Decreasing
1996/08/01
English
Lower Bounds for Randomized k-Server and Motion-Planning Algorithms
1994/04/01
English
Communication-Space Tradeoffs for Unrestricted Protocols
1994/06/01
English
Generalized Kraft’s Inequality and Discrete k-Modal Search
1996/04/01
English
Linear Time Algorithms and NP-Complete Problems
1994/06/01
English
The Specialization of Programs by Theorem Proving
1973/03/01
English
Greedy Packet Scheduling
1995/02/01
English
Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees
1990/08/01
English
A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
1996/12/01
English
A Randomized Maximum-Flow Algorithm
1995/04/01
English
Optimal File Sharing in Distributed Networks
1995/02/01
English
A General Approach to Removing Degeneracies
1995/06/01
English
Homeomorphism of 2-Complexes is Graph Isomorphism Complete
1994/02/01
English
A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
1994/12/01
English
«
‹ Pervious
Next ›
»