Parallelism in graph-partitioning

This publication has 14 references indexed in Scilit:

• Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors
  IEEE Transactions on Parallel and Distributed Systems, 1990
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
  Operations Research, 1989
• Scans as primitive parallel operations
  IEEE Transactions on Computers, 1989
• How easy is local search?
  Journal of Computer and System Sciences, 1988
• Graph bisection algorithms with good average case behavior
  Combinatorica, 1987
• Parallel algorithms for chip placement by simulated annealing
  IBM Journal of Research and Development, 1987
• A Procedure for Placement of Standard-Cell VLSI Circuits
  IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1985
• A space efficient algorithm for the monotone planar circuit value problem
  Information Processing Letters, 1980
• Computational Complexity of Probabilistic Turing Machines
  SIAM Journal on Computing, 1977
• The monotone and planar circuit value problems are log space complete for P
  ACM SIGACT News, 1977