| The art of computer programming, volume 3: (2nd ed.) sorting and searching |
| |
|
| Source
|
Pages: 780
Year of Publication: 1998
ISBN:0-201-89685-0
|
|
Author
|
|
| Publisher |
Addison Wesley Longman Publishing Co., Inc.
Redwood City, CA, USA
|
| Bibliometrics |
Downloads (6 Weeks): n/a, Downloads (12 Months): n/a, Citation Count: 1255
|
|
|
 CITED BY 1,255
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Kyu-Young Whang , Art Ammann , Anthony Bolmarcich , Maria Hanrahan , Guy Hochgesang , Kuan-Tsae Huang , Al Khorasani , Ravi Krishnamurthy , Gary Sockut , Paula Sweeney , Vance Waddle , Moshé Zloof, Office-by-example: an integrated office system and database manager, ACM Transactions on Information Systems (TOIS), v.5 n.4, p.393-427, Oct. 1987
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Arne Andersson , Torben Hagerup , Stefan Nilsson , Rajeev Raman, Sorting in linear time?, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.427-436, May 29-June 01, 1995, Las Vegas, Nevada, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lon-Mu Liu , Yair M. Babad , Wei Sun , Ki-Kan Chan, Adaptive post-processing of OCR text via knowledge acquisition, Proceedings of the 19th annual conference on Computer Science, p.558-569, April 1991, San Antonio, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Rakesh Barve , Mahesh Kallahalla , Peter J. Varman , Jeffrey Scott Vitter, Competitive parallel disk prefetching and buffer management, Proceedings of the fifth workshop on I/O in parallel and distributed systems, p.47-56, November 17-17, 1997, San Jose, California, 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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Richard E. Ladner , James D. Fix , Anthony LaMarca, Cache performance analysis of traversals and random accesses, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.613-622, January 17-19, 1999, Baltimore, Maryland, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Joseph M. Hellerstein , Elias Koutsoupias , Christos H. Papadimitriou, On the analysis of indexing schemes, Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.249-256, May 11-15, 1997, Tucson, Arizona, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Harry Buhrman , Matthew Franklin , Juan A. Garay , Jaap-Henk Hoepman , John Tromp , Paul Vitányi, Mutual search, Journal of the ACM (JACM), v.46 n.4, p.517-536, July 1999
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Mark H. Nodine , Michael T. Goodrich , Jeffrey Scott Vitter, Blocking for external graph searching, Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.222-232, May 25-28, 1993, Washington, D.C., United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Moses Charikar , Samir Khuller , Balaji Raghavachari, Algorithms for capacitated vehicle routing, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.349-358, May 24-26, 1998, Dallas, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Julien Clément , Philippe Flajolet , Brigitte Vallée, The analysis of hybrid trie structures, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.531-539, January 25-27, 1998, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Jiří Matoušek , David M. Mount , Nathan S. Netanyahu, Efficient randomized algorithms for the repeated median line estimator, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.74-82, January 25-27, 1993, Austin, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A. Vagelatos , T. Triantopoulou , C. Tsalidis , D. Christodoulakis, Utilization of a lexicon for spelling correction in modern Greek, Proceedings of the 1995 ACM symposium on Applied computing, p.267-271, February 26-28, 1995, Nashville, Tennessee, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
F R Chung , D J Hajela , P D Seymour, Self-organizing sequential search and Hilbert's inequalities, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.217-223, May 06-08, 1985, Providence, Rhode Island, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
P. D. Alevizos , J. Boissonnat , M. Yvinec, An optimal O(n log n) algorithm for contour reconstruction from rays, Proceedings of the third annual symposium on Computational geometry, p.162-170, June 08-10, 1987, Waterloo, Ontario, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
O. Nurmi , E. Soisalon-Soininen , D. Wood, Concurrency control in database structures with relaxed balance, Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.170-176, March 23-25, 1987, San Diego, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
D. Bhagavathi , W. M. Denny , C. Grosch , P. J. Looges , S. Olariu, Sorting and merging on the DAP, Proceedings of the 30th annual Southeast regional conference, April 08-10, 1992, Raleigh, North Carolina
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Bogdan S. Chlebus , Stefan Dobrev , Dariusz R. Kowalski , Grzegorz Malewicz , Alex Shvartsman , Imrich Vrto, Towards practical deteministic write-all algorithms, Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, p.271-280, July 2001, Crete Island, Greece
|
|
|
|
|
|
|
|
|
Fan Chung , Ronald Graham , Tom Leighton, Guessing secrets, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.723-726, January 07-09, 2001, Washington, D.C., United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sunil Arya , Theocharis Malamatos , David M. Mount, A simple entropy-based algorithm for planar point location, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.262-268, January 07-09, 2001, Washington, D.C., United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Edward S. Chen , Daniel B. Davison, Distributing molecular biology information: Gopher, WAIS and the University of Houston Gene-Server, Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, p.634-640, February 14-16, 1993, Indianapolis, Indiana, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yossi Matias , Jeffrey Scott Vitter , Wen-Chun Ni, Dynamic generation of discrete random variates, Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, p.361-370, January 25-27, 1993, Austin, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
Ashok Rathi , Huizhu Lu , G. E. Hedrick, Performance comparison of extendible hashing and linear hashing techniques, Proceedings of the 1990 ACM SIGSMALL/PC symposium on Small systems, p.178-185, March 28-30, 1990, Crystal City, Virginia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Paul Hartono Singgih , Howard B. Demuth , Martin T. Hagan , Roger L. Wainwright, Parallel merge-sort algorithms on the HEP, Proceedings of the 1986 ACM fourteenth annual conference on Computer science, p.237-244, February 1986, Cincinnati, Ohio, United States
|
|
|
Cedric Adjih , Leonidas Georgiadis , Philippe Jacquet , Wojciech Szpankowski, Is the internet fractal?, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.338-345, January 06-08, 2002, San Francisco, California
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Kenneth J. Supowit , David A. Plaisted , Edward M. Reingold, Heuristics for weighted perfect matching, Proceedings of the twelfth annual ACM symposium on Theory of computing, p.398-419, April 28-30, 1980, Los Angeles, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Jesse M. Gordon , Quentin F. Stout, Hypercube message routing in the presence of faults, Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues, p.318-327, January 19-20, 1988, Pasadena, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
L. Hyafil , F. Prusker , J. Vuillemin, An efficient algorithm for computing optimal disk merge patterns. (Extended Abstract), Proceedings of the sixth annual ACM symposium on Theory of computing, p.216-229, April 30-May 02, 1974, Seattle, Washington, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A. Borodin , J. E. Hopcroft, Routing, merging and sorting on parallel models of computation, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.338-344, May 05-07, 1982, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Brian Nixon , Lawrence Chung , John Mylopoulos , David Lauzon , Alex Borgida , M. Stanley, Implementation of a compiler for a semantic data model: Experiences with taxis, ACM SIGMOD Record, v.16 n.3, p.118-131, Dec. 1987
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Michael A. Bender , Ziyang Duan , John Iacono , Jing Wu, A locality-preserving cache-oblivious dynamic dictionary, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, p.29-38, January 06-08, 2002, San Francisco, California
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sunil Arya , Theocharis Malamatos , David M. Mount, Entropy-preserving cuttings and space-efficient planar point location, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.256-261, January 07-09, 2001, Washington, D.C., United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
S. Hurtubise , T. Gavin , A. Girard, Adaptation of the TL event list algorithm to the GASP IV simulation language, Proceedings of the 13th conference on Winter simulation, p.599-609, December 09-11, 1981, Atlanta, Georgia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Michael Pidd , F. N. de Silva , Richard W. Eglese, CEMPS: a configurable evacuation management and planning system—a progress report, Proceedings of the 25th conference on Winter simulation, p.1319-1323, December 12-15, 1993, Los Angeles, 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
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Peter Sanders , Sebastian Egner , Jan Korst, Fast concurrent access to parallel disks, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.849-858, January 09-11, 2000, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Leo J. Guibas , Edward M. McCreight , Michael F. Plass , Janet R. Roberts, A new representation for linear lists, Proceedings of the ninth annual ACM symposium on Theory of computing, p.49-60, May 04-04, 1977, Boulder, Colorado, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Qinglong Hu , Dik Lun Lee , Wang-Chien Lee, Performance evaluation of a wireless hierarchical data dissemination system, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, p.163-173, August 15-19, 1999, Seattle, Washington, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lilian Harada , Naoki Akaboshi , Kazutaka Ogihara , Riichiro Take, Dynamic skew handling in parallel mining of association rules, Proceedings of the seventh international conference on Information and knowledge management, p.76-85, November 02-07, 1998, Bethesda, Maryland, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Piotr Indyk , Rajeev Motwani , Prabhakar Raghavan , Santosh Vempala, Locality-preserving hashing in multidimensional spaces, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.618-625, May 04-06, 1997, El Paso, Texas, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
S. Muthukrishnan , Mike Paterson , Süleyman Cenk Sahinalp , Torsten Suel, Compact grid layouts of multi-level networks, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.455-463, May 01-04, 1999, Atlanta, Georgia, United States
|
|
|
D D Sleator , R E Tarjan , W P Thurston, Rotation distance, triangulations, and hyperbolic geometry, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.122-135, May 28-30, 1986, Berkeley, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
M. Dowd , Y. Perl , M. Saks , L. Rudolph, The balanced sorting network, Proceedings of the second annual ACM symposium on Principles of distributed computing, p.161-172, August 17-19, 1983, Montreal, Quebec, Canada
|
|
|
Antti Aaltonen , Aulikki Hyrskykari , Kari-Jouko Räihä, 101 spots, or how do users read menus?, Proceedings of the SIGCHI conference on Human factors in computing systems, p.132-139, April 18-23, 1998, Los Angeles, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
Masaru Kitsuregawa , Miyuki Nakano , Lilian Harada , Mikio Takagi, Performance evaluation of functional disk system with nonuniform data distribution, Proceedings of the second international symposium on Databases in parallel and distributed systems, p.80-89, July 02-04, 1990, Dublin, Ireland
|
|
|
|
|
|
|
|
|
|
|
|
Tamraparni Dasu , Theodore Johnson , S. Muthukrishnan , Vladislav Shkapenyuk, Mining database structure; or, how to build a data quality browser, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
E. G. Daylight , S. Wuytack , C. Ykman-Couvreur , F. Catthoor, Analyzing energy friendly steady state phases of dynamic application execution in terms of sparse data structures, Proceedings of the 2002 international symposium on Low power electronics and design, August 12-14, 2002, Monterey, California, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Catherine McGeoch , Peter Sanders , Rudolf Fleischer , Paul R. Cohen , Doina Precup, Using finite experiments to study asymptotic performance, Experimental algorithmics: from algorithm design to robust and efficient software, Springer-Verlag New York, Inc., New York, NY, 2002
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
T. S. Jayram , Subhash Khot , Ravi Kumar , Yuval Rabani, Cell-probe lower bounds for the partial match problem, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Jayme L. Szwarcfiter , Gonzalo Navarro , Ricardo Baeza-Yates , Joísa de S. Oliveira , Walter Cunto , Nívio Ziviani, Optimal binary search trees with costs depending on the access paths, Theoretical Computer Science, v.290 n.3, p.1799-1814, 3 January 2003
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Therese Biedl , Timothy Chan , Erik D. Demaine , Rudolf Fleischer , Mordecai Golin , James A. King , J. Ian Munro, Fun-sort--or the chaos of unordered binary search, Discrete Applied Mathematics, v.144 n.3, p.231-236, 15 December 2004
|
|
|
Christian S. Jensen , Jan Kolářvr , Torben Bach Pedersen , Igor Timko, Nearest neighbor queries in road networks, Proceedings of the 11th ACM international symposium on Advances in geographic information systems, p.1-8, November 07-08, 2003, New Orleans, Louisiana, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Therese Biedl , Broňa Brejová , Erik D. Demaine , Angèle M. Hamel , Alejandro López-Ortiz , Tomáš Vinař, Finding hidden independent sets in interval graphs, Theoretical Computer Science, v.310 n.1-3, p.287-307, 01 January 2004
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Michael A. Bender , Dongdong Ge , Simai He , Haodong Hu , Ron Y. Pinter , Steven Skiena , Firas Swidan, Improved bounds on sorting with length-weighted reversals, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, January 11-14, 2004, New Orleans, Louisiana
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
David M. Arnow , Aaron M. Tenenbaum , Connie Wu, P-trees: storage efficient multiway trees, Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval, p.111-121, June 05-07, 1985, Montreal, Quebec, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
David Eppstein , Zvi Galil , Raffaele Giancarlo , Giuseppe F. Italiano, Sparse dynamic programming, Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, p.513-522, January 22-24, 1990, San Francisco, California, United States
|
|
|
|
|
|
N. Alon , F. R. K. Chung , R. L. Graham, Routing permutations on graphs via matchings, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.583-591, May 16-18, 1993, San Diego, California, 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
|
|
|
|
|
|
J. Bézivin , F. Gauduel , J. L. Nebut , R. Rannou, On the necessary evolution towards improvement specialization in software production teams, Proceedings of the fifteenth annual SIGCPR conference, p.190-202, August 18-19, 1977, Arlington, Virginia, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Robert Geist , Darrell Suggs , Robert Reynolds , Shardul Divatia , Fred Harris , Evan Foster , Priyadarshan Kolte, Disk performance enhancement through Markov-based cylinder remapping, Proceedings of the 30th annual Southeast regional conference, April 08-10, 1992, Raleigh, North Carolina
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Nabil Kahale , Tom Leighton , Yuan Ma , C. Greg Plaxton , Torsten Suel , Endre Szemerédi, Lower bounds for sorting networks, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.437-446, May 29-June 01, 1995, Las Vegas, Nevada, United States
|
|
|
Stefan Burkhardt , Andreas Crauser , Paolo Ferragina , Hans-Peter Lenhof , Eric Rivals , Martin Vingron, q-gram based database searching using a suffix array (QUASAR), Proceedings of the third annual international conference on Computational molecular biology, p.77-83, April 11-14, 1999, Lyon, France
|
|
|
|
|
|
Shimon Even , S. Muthukrishnan , Michael S. Paterson , Süleyman Cenk Sahinalp, Layout of the batcher bitonic sorter (extended abstract), Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.172-181, June 28-July 02, 1998, Puerto Vallarta, Mexico
|
|
|
|
|
|
|
|
|
Feng Zhou , Esther Y. Cheng , Bo Yao , Chung-Kuan Cheng , Ronald Graham, A hierarchical three-way interconnect architecture for hexagonal processors, Proceedings of the 2003 international workshop on System-level interconnect prediction, April 05-06, 2003, Monterey, CA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Philippe Flajolet , Gaston Gonnet , Claude Puech , J. M. Robson, The analysis of multidimensional searching in quad-trees, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.100-109, January 28-30, 1991, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
Gregory L. Heileman , Chaouki T. Abdallah , Bernard M. E. Moret , Bradley J. Smith, Dynamical system representation of open address hash functions, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.919-920, January 17-19, 1999, Baltimore, Maryland, United States
|
|
|
|
|
|
|
|
|
|
|
|
Miklós Ajtai , T. S. Jayram , Ravi Kumar , D. Sivakumar, Approximate counting of inversions in a data stream, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Tom Leighton , Yuan Ma , Torsten Suel, On probabilistic networks for selection, merging, and sorting, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, p.106-118, June 24-26, 1995, Santa Barbara, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
W. W. Tsang , L. C. K. Hui , K. P. Chow , C. F. Chong , C. W. Tso, Tuning the collision test for power, Proceedings of the 27th Australasian conference on Computer science, p.23-30, January 01, 2004, Dunedin, New Zealand
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Tun-Wen Pai , Margaret Dah-Tsyr Chang , Jia-Han Chu , Wei-Yuan Chang , Hsiu Ling Tai, Ladderlike stepping and interval jumping searching algorithms for DNA sequences, Proceedings of the second conference on Asia-Pacific bioinformatics, p.93-98, January 01, 2004, Dunedin, New Zealand
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Kenichi YOSHIDA , Fuminori ADACHI , Takashi WASHIO , Hiroshi MOTODA , Teruaki HOMMA , Akihiro NAKASHIMA , Hiromitsu FUJIKAWA , Katsuyuki YAMAZAKI, Density-based spam detector, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Bijit Hore , Hakan Hacigumus , Bala Iyer , Sharad Mehrotra, Indexing text data under space constraints, Proceedings of the thirteenth ACM international conference on Information and knowledge management, November 08-13, 2004, Washington, D.C., USA
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
A. R. Calderbank , A. Gilbert , K. Levchenko , S. Muthukrishnan , M. Strauss, Improved range-summable random variable construction algorithms, Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, January 23-25, 2005, Vancouver, British Columbia
|
|
|
|
|
|
Michael H. Albert , Alexander Golynski , Angèle M. Hamel , Alejandro López-Ortiz , S. Srinivasa Rao , Mohammad Ali Safari, Longest increasing subsequences in sliding windows, Theoretical Computer Science, v.321 n.2-3, p.405-414, 16 August 2004
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Y. Kadoya , M. Fuketa , El-Sayed Atlam , K. Morita , T. Sumitomo , J. Aoe, A compression algorithm using integrated record information for translation dictionaries, Information Sciences—Informatics and Computer Science: An International Journal, v.165 n.3-4, p.171-186, 19 October 2004
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Jens-Peter Dittrich , Bernhard Seeger , David Scot Taylor , Peter Widmayer, On producing join results early, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.134-142, June 09-11, 2003, San Diego, California
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
S. W. Hornick , S. R. Maddila , E. P. Mücke , H. Rosenberger , S. S. Skiena , I. G. Tollis, Searching on a Tape, IEEE Transactions on Computers, v.39 n.10, p.1265-1272, October 1990
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Magnus Andersson , Per Svensson, A study of modified interpolation search in compressed, fully transposed, ordered files, Proceedings of the 4th international conference on Statistical and Scientific Database Management, p.72-92, June 21-23, 1988, Rome, Italy
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Lars Arge , Michael A. Bender , Erik D. Demaine , Bryan Holland-Minkley , J. Ian Munro, Cache-oblivious priority queue and graph algorithm applications, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
