ACM SIGACT News
ACM Transactions on Programming Languages and Systems (TOPLAS)
Randomized binary search trees
Journal of the ACM (JACM)
A Unifying Lattice-Based Approach for the Partitioning of Systolic Arrays via LPGS and LSGP
Journal of VLSI Signal Processing Systems
Efficient solution of systems of orientation constraints
ISPD '99 Proceedings of the 1999 international symposium on Physical design
To cut…or not to cut (applications of comparative physical maps in molecular evolution)
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A combinatorial algorithm for the determinant
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Shortest path queries in planar graphs
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Path set selection in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Online algorithms for market clearing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A fully dynamic algorithm for maintaining the transitive closure
Journal of Computer and System Sciences - STOC 1999
Improved approximations of independent sets in bounded-degree graphs via subgraph removal
Nordic Journal of Computing
Parameterized Counting Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Counting Satisfying Assignments in 2-SAT and 3-SAT
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Branch, Cut, and Price: Sequential and Parallel
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Dichotomy Theorem for the Generalized Unique Satisfiability Problem
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On the complexity of reasoning in Kleene algebra
Information and Computation - Special issue: LICS'97
On unique graph 3-colorability and parsimonious reductions in the plane
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Spacetime faces: high resolution capture for modeling and animation
ACM SIGGRAPH 2004 Papers
Fast index filtering in vector approximation file
Fundamenta Informaticae
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms
Scalable routing overlay networks
ACM SIGOPS Operating Systems Review
The Bergman complex of a matroid and phylogenetic trees
Journal of Combinatorial Theory Series B
Online algorithms for market clearing
Journal of the ACM (JACM)
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Nash equilibria in discrete routing games with convex latency functions
Journal of Computer and System Sciences
Proceedings of the 10th ACM conference on Electronic commerce
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
On finding fundamental cut sets
Information Processing Letters
A tighter bound for counting max-weight solutions to 2SAT instances
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
The algebraic approach I: the algebraization of the chomsky hierarchy
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Counting complexity of propositional abduction
Journal of Computer and System Sciences
Rethinking database updates using a multiple assignment-based approach
WSEAS Transactions on Computers
Towards an algebra of routing tables
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
BFS solution for disjoint paths in P systems
UC'11 Proceedings of the 10th international conference on Unconventional computation
Union-find with constant time deletions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Engineering planar separator algorithms
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On fast and approximate attack tree computations
ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
Approximation scheme for lowest outdegree orientation and graph density measures
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Mechanism design for double auctions with temporal constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Planarizing gadgets for perfect matching do not exist
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Fast Index Filtering in Vector Approximation File
Fundamenta Informaticae
New solutions for disjoint paths in P systems
Natural Computing: an international journal
Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
ACM Transactions on Computational Logic (TOCL)
A dichotomy in the complexity of counting database repairs
Journal of Computer and System Sciences
| Hi-index | 0.00 |