|
 ABSTRACT
From the Publisher: With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter. 0201000296B04062001 |
CITED BY 1,409
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Claudio Bettini , X. Sean Wang , Sushil Jajodia, Testing complex temporal relationships involving multiple granularities and its application to data mining (extended abstract), Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.68-78, June 04-06, 1996, Montreal, Quebec, Canada
|
|
|
|
|
|
|
|
|
Giorgio Ausiello , Giuseppe F. Italiano , Alberto Marchetti Spaccamela , Umberto Nanni, Incremental algorithms for minimal length paths, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.12-21, January 22-24, 1990, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Joachim von zur Gathen , Jürgen Gerhard, Fast algorithms for Taylor shifts and certain difference equations, Proceedings of the 1997 international symposium on Symbolic and algebraic computation, p.40-47, July 21-23, 1997, Kihei, Maui, Hawaii, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Cynthia A. Brown , Larry Finkelstein , Paul Walton Purdom, Jr., Intelligent backtracking using symmetry, Proceedings of 1986 ACM Fall joint computer conference, p.576-584, November 1986, Dallas, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yusuke Matsunaga , Patrick C. McGeer , Robert K. Brayton, On computing the transitive closure of a state transition relation, Proceedings of the 30th international conference on Design automation, p.260-265, June 14-18, 1993, Dallas, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A. Aggarwal , B. Alpern , A. Chandra , M. Snir, A model for hierarchical memory, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.305-314, January 1987, New York, New York, United States
|
|
|
|
|
|
|
|
|
|
|
|
Srimat T. Chakradhar , Vishwani D. Agrawal , Michael L. Bushnell, Automatic test generation using quadratic 0-1 programming, Proceedings of the 27th ACM/IEEE conference on Design automation, p.654-659, June 24-27, 1990, Orlando, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Alberto Bertoni , Giancarlo Mauri , Nicoletta Sabadini, A characterization of the class of functions computable in polynomial time on Random Access Machines, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.168-176, May 11-13, 1981, Milwaukee, Wisconsin, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Dean F. Jerding , John T. Stasko , Thomas Ball, Visualizing interactions in program executions, Proceedings of the 19th international conference on Software engineering, p.360-370, May 17-23, 1997, Boston, Massachusetts, United States
|
|
|
|
|
|
|
|
|
|
|
|
Hervé Brönnimann , Ioannis Z. Emiris , Victor Y. Pan , Sylvain Pion, Computing exact geometric predicates using modular arithmetic with single precision, Proceedings of the thirteenth annual symposium on Computational geometry, p.174-182, June 04-06, 1997, Nice, France
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Luc Boasson , Patrick Cegielski , Irène Guessarian , Yuri Matiyasevich, Window-accumulated subsequence matching problem is linear, Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.327-336, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sujit Dey , Franc Brglez , Gershon Kedem, Corolla based circuit partitioning and resynthesis, Proceedings of the 27th ACM/IEEE conference on Design automation, p.607-612, June 24-27, 1990, Orlando, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
R. Ravi , M. V. Marathe , S. S. Ravi , D. J. Rosenkrantz , H. B. Hunt, III, Many birds with one stone: multi-objective approximation algorithms, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.438-447, May 16-18, 1993, San Diego, California, United States
|
|
|
Ming-Yang Kao , Tak-Wah Lam , Teresa M. Przytycka , Wing-Kin Sung , Hing-Fung Ting, General techniques for comparing unrooted evolutionary trees, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.54-65, May 04-06, 1997, El Paso, Texas, United States
|
|
|
|
|
|
Zvi Galil , Giuseppe F. Italiano , Neil Sarnak, Fully dynamic planarity testing (extended abstract), Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.495-506, May 04-06, 1992, Victoria, British Columbia, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Kaushik Dutta , Debra VanderMeer , Anindya Datta , Krithi Ramamritham, Discovering critical edge sequences in E-commerce catalogs, Proceedings of the 3rd ACM conference on Electronic Commerce, p.65-74, October 14-17, 2001, Tampa, Florida, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
J. F. Canny , E. Kaltofen , L. Yagati, Solving systems of nonlinear polynomial equations faster, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.121-128, July 17-19, 1989, Portland, Oregon, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Boris V. Cherkassky , Andrew V. Goldberg , Craig Silverstein, Buckets, heaps, lists, and monotone priority queues, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.83-92, January 05-07, 1997, New Orleans, Louisiana, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
S. K. Abdali , Guy W. Cherry , Neil Soiffer, An object-oriented approach to algebra system design, Proceedings of the fifth ACM symposium on Symbolic and algebraic computation, p.24-30, July 21-23, 1986, Waterloo, Ontario, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Thomas E. Cheatham, Jr. , Judy A. Townley , Glenn H. Holloway, A system for program refinement, Proceedings of the 4th international conference on Software engineering, p.53-62, September 17-19, 1979, Munich, Germany
|
|
|
|
|
|
|
|
|
Paris C. Kanellakis , Scott A. Smolka, CCS expressions, finite state processes, and three problems of equivalence, Proceedings of the second annual ACM symposium on Principles of distributed computing, p.228-240, August 17-19, 1983, Montreal, Quebec, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
B.-M. Hsieh , M. Hind , R. Cytron, Loop distribution with multiple exits, Proceedings of the 1992 ACM/IEEE conference on Supercomputing, p.204-213, November 16-20, 1992, Minneapolis, Minnesota, United States
|
|
|
|
|
|
Joe Buhler , M. Amin Shokrollahi , Volker Stemann, Fast and precise computations of discrete Fourier transforms using cyclotomic integers, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.40-47, May 04-06, 1997, El Paso, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
X. Hu , R. G. Harber , S. C. Bass, Minimizing the number of delay buffers in the synchronization of pipelined systems, Proceedings of the 28th conference on ACM/IEEE design automation, p.758-763, June 17-22, 1991, San Francisco, California, United States
|
|
|
|
|
|
Gene Cooperman , Larry Finkelstein , Bryant York , Michael Tselman, Constructing permutation representations for large matrix groups, Proceedings of the international symposium on Symbolic and algebraic computation, p.134-138, July 20-22, 1994, Oxford, United Kingdom
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Henrik Hulgaard , Steven M. Burns , Tod Amon , Gaetano Borriello, Practical applications of an efficient time separation of events algorithm, Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, p.146-151, November 07-11, 1993, Santa Clara, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
M. R. Garey , R. L. Graham , D. S. Johnson, Some NP-complete geometric problems, Proceedings of the eighth annual ACM symposium on Theory of computing, p.10-22, May 03-05, 1976, Hershey, Pennsylvania, United States
|
|
|
|
|
|
|
|
|
B. Alpern , M. N. Wegman , F. K. Zadeck, Detecting equality of variables in programs, Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-11, January 10-13, 1988, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Bruce W. Schmeiser , Thanos N. Avramidis , Sherif Hashem, Overlapping batch statistics, Proceedings of the 22nd conference on Winter simulation, p.395-398, December 09-12, 1990, New Orleans, Louisiana, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Thomas Reps , Susan Horwitz , Mooly Sagiv, Precise interprocedural dataflow analysis via graph reachability, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.49-61, January 23-25, 1995, San Francisco, California, United States
|
|
|
Z. M. Kedem , K. V. Palem , P. G. Spirakis, Efficient robust parallel computations, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.138-148, May 13-17, 1990, Baltimore, Maryland, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A. Aggarwal , R. J. Anderson , M.-Y. Kao, Parallel depth-first search in general directed graphs, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.297-308, May 14-17, 1989, Seattle, Washington, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
R. Ravi , R. Sundaram , M. V. Marathe , D. J. Rosenkrantz , S. S. Ravi, Spanning trees short or small, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.546-555, January 23-25, 1994, Arlington, Virginia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lars Arge , Paolo Ferragina , Roberto Grossi , Jeffrey Scott Vitter, On sorting strings in external memory (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.540-548, May 04-06, 1997, El Paso, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Tapan J. Chakraborty , Sudipta Bhawmik , Robert Bencivenga , C. J. Lin, Enhanced controllability for IDDQ test sets using partial scan, Proceedings of the 28th conference on ACM/IEEE design automation, p.278-281, June 17-22, 1991, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mariusz Niewczas , Wojciech Maly , Andrzej Strojwas, A pattern matching algorithm for verification and analysis of very large IC layouts, Proceedings of the 1998 international symposium on Physical design, p.129-134, April 06-08, 1998, Monterey, California, United States
|
|
|
|
|
|
Herbert Edelsbrunner , Tiow Seng Tan , Roman Waupotitsch, An O(n2log n) time algorithm for the MinMax angle triangulation, Proceedings of the sixth annual symposium on Computational geometry, p.44-52, June 07-09, 1990, Berkley, California, United States
|
|
|
László Babai , Lance Fortnow , Leonid A. Levin , Mario Szegedy, Checking computations in polylogarithmic time, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.21-32, May 05-08, 1991, New Orleans, Louisiana, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sanjeev Khanna , Rajeev Motwani , Randall H. Wilson, On certificates and lookahead in dynamic graph problems, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.222-231, January 28-30, 1996, Atlanta, Georgia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Susan L. Graham , Michael A. Harrison , Walter L. Ruzzo, On line context free language recognition in less than cubic time(Extended Abstract), Proceedings of the eighth annual ACM symposium on Theory of computing, p.112-120, May 03-05, 1976, Hershey, Pennsylvania, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yossi Matias , Jeffrey Scott Vitter , Neal E. Young, Approximate data structures with applications, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, p.187-194, January 23-25, 1994, Arlington, Virginia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Micah Adler , John W. Byers , Richard M. Karp, Parallel sorting with limited bandwidth, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, p.129-136, June 24-26, 1995, Santa Barbara, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adam L. Buchsbaum , Paris C. Kanellakis , Jeffrey S. Vitter, A data structure for arc insertion and regular path finding, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.22-31, January 22-24, 1990, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
S. G. Chappell , P. R. Menon , J. F. Pellegrin , A. M. Schowe, Functional simulation in the lamp system, Proceedings of the 13th conference on Design automation, p.42-47, June 28-30, 1976, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Z. M. Kedem , K. V. Palem , A. Raghunathan , P. G. Spirakis, Combining tentative and definite executions for very fast dependable parallel computing, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.381-390, May 05-08, 1991, New Orleans, Louisiana, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Aythan Avior , Tiziana Calamoneri , Shimon Even , Ami Litman , Arnold L. Rosenberg, A tight layout of the butterfly network, Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures, p.170-175, June 24-26, 1996, Padua, Italy
|
|
|
|
|
|
|
|
|
Takashi Mitsuhashi , Toshiaki Chiba , Makoto Takashima , Kenji Yoshida, An integrated mask artwork analysis system, Proceedings of the 17th conference on Design automation, p.277-284, June 23-25, 1980, Minneapolis, Minnesota, United States
|
|
|
|
|
|
Jacobo Valdes , Robert E. Tarjan , Eugene L. Lawler, The recognition of Series Parallel digraphs, Proceedings of the eleventh annual ACM symposium on Theory of computing, p.1-12, April 30-May 02, 1979, Atlanta, Georgia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Chun-Hung Cheng , Ada Waichee Fu , Yi Zhang, Entropy-based subspace clustering for mining numerical data, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.84-93, August 15-18, 1999, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Erik D. Demaine , Alejandro López-Ortiz , J. Ian Munro, Adaptive set intersections, unions, and differences, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.743-752, January 09-11, 2000, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Donald F. Stanat , E. Hollins Williams, Jr., Optimal associative searching on a cellular computer, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.99-106, October 18-22, 1981, Portsmouth, New Hampshire, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
P. Flajolet , J. Françon , J. Vuillemin, Computing integrated costs of sequences of operations with application to dictionaries, Proceedings of the eleventh annual ACM symposium on Theory of computing, p.49-61, April 30-May 02, 1979, Atlanta, Georgia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mihir Bellare , Oded Goldreich , Shafi Goldwasser, Incremental cryptography and application to virus protection, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.45-56, May 29-June 01, 1995, Las Vegas, Nevada, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Eitan M. Gurari , Oscar H. Ibarra, The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs, Proceedings of the eleventh annual ACM symposium on Theory of computing, p.142-152, April 30-May 02, 1979, Atlanta, Georgia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
D. J. Kuck , R. H. Kuhn , D. A. Padua , B. Leasure , M. Wolfe, Dependence graphs and compiler optimizations, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.207-218, January 26-28, 1981, Williamsburg, Virginia
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Z. Renbao , X. Ling , R. Zhaoyang, The computer algebra system CAS1 for the IBM-PC, Proceedings of the fifth ACM symposium on Symbolic and algebraic computation, p.176-178, July 21-23, 1986, Waterloo, Ontario, Canada
|
|
|
H Suzuki , T Nishizeki , N Saito, Multicommodity flows in planar undirected graphs and shortest paths, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.195-204, May 06-08, 1985, Providence, Rhode Island, United States
|
|
|
|
|
|
|
|
|
|
|
|
Srinivas Doddi , Madhav V. Marathe , Andy Mirzaian , Bernard M. E. Moret , Binhai Zhu, Map labeling and its generalizations, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.148-157, January 05-07, 1997, New Orleans, Louisiana, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
R. D. Lou , M. Sarrafzadeh , D. T. Lee, An optimal algorithm for the maximum two-chain problem, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.149-158, January 22-24, 1990, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
R. I. Bahar , E. A. Frohm , C. M. Gaona , G. D. Hachtel , E. Macii , A. Pardo , F. Somenzi, Algebric Decision Diagrams and Their Applications, Formal Methods in System Design, v.10 n.2-3, p.171-206, April -May 1997
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Torben Amtoft , Charles Consel , Olivier Danvy , Karoline Malmkjær, The abstraction and instantiation of string-matching programs, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Costas S. Iliopoulos , Manal Mohamed , Laurent Mouchard , W. F. Smyth , Katerina G. Perdikuri , Athanasios K. Tsakalidis, String regularities with don't cares, Nordic Journal of Computing, v.10 n.1, p.40-51, Spring 2003
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Daniel G. Saab , Youssef G. Saab , Jacob A. Abraham, Iterative [simulation-based genetics + deterministic techniques]= complete ATPG0, Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design, p.40-43, November 06-10, 1994, San Jose, California, United States
|
|
|
Jiazhen Cai , Robert A. Paige, Look ma, no hashing, and no arrays neither, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.143-154, January 21-23, 1991, Orlando, Florida, United States
|
|
|
Liuba Shrira , Nissim Francez , Michael Rodeh, Distributed k-selection: From a sequential to a distributed algorithm, Proceedings of the second annual ACM symposium on Principles of distributed computing, p.143-153, August 17-19, 1983, Montreal, Quebec, Canada
|
|
|
T. Asano , B. Bhattacharya , M. Keil , F. Yao, Clustering algorithms based on minimum and maximum spanning trees, Proceedings of the fourth annual symposium on Computational geometry, p.252-257, June 06-08, 1988, Urbana-Champaign, Illinois, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adam L. Buchsbaum , Haim Kaplan , Anne Rogers , Jeffery R. Westbrook, Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.279-288, May 24-26, 1998, Dallas, Texas, United States
|
|
|
Bin Ma , Ming Li , Louxin Zhang, On reconstructing species trees from gene trees in term of duplications and losses, Proceedings of the second annual international conference on Computational molecular biology, p.182-191, March 22-25, 1998, New York, New York, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Richard Cole , Ramesh Hariharan , Piotr Indyk, Tree pattern matching and subset matching in deterministic O(n log3 n)-time, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.245-254, January 17-19, 1999, Baltimore, Maryland, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sharad Mehrotra , Rajeev Rastogi , Yuri Breitbart , Henry F. Korth , Avi Silberschatz, The concurrency control problem in multidatabases: characteristics and solutions, ACM SIGMOD Record, v.21 n.2, p.288-297, June 1, 1992
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Philip LoCascio , Kaizhi Yue , Peter Cummings , Ken Dill, The large scale parallelization of a conformational 3D Protein structure prediction application, Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM), p.1-6, November 07-13, 1998, San Jose, CA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Gabriela Alexe , Sorin Alexe , Yves Crama , Stephan Foldes , Peter L. Hammer , Bruno Simeone, Consensus algorithms for the generation of all maximal bicliques, Discrete Applied Mathematics, v.145 n.1, p.11-21, 30 December 2004
|
|
|
|
|
|
|
|
|
|
|
|
A. Norman , A. Ahmed , J. Chou , A. Dalal , K. Fortson , M. Jindal , C. Kurz , H. Lee , K. Payne , R. Rando , K. Sheppard , E. Sublett , J. Sussman , I. White, On the Computational Complexity of Consumer Decision Rules, Computational Economics, v.23 n.2, p.173-192, March 2004
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mikhail Atallah , Marina Bykova , Jiangtao Li , Keith Frikken , Mercan Topkara, Private collaborative forecasting and benchmarking, Proceedings of the 2004 ACM workshop on Privacy in the electronic society, October 28-28, 2004, Washington DC, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
