Skip header Section
Skip Bibliometrics Section
Introduction to Algorithms: A Creative ApproachJanuary 1989
- Author:
- Udi Manber
Abstract
No abstract available.
Cited By
Barbudo E, Dokladalova E, Grandpierre T and George L A New Mapping Methodology for Coarse-Grained Programmable Systolic Architectures Proceedings of the 22nd International Workshop on Software and Compilers for Embedded Systems, (5-12)- Hoffmann S, Elterman A and Wanke E (2016). A linear time algorithm for metric dimension of cactus block graphs, Theoretical Computer Science, 630:C, (43-62), Online publication date: 30-May-2016.
- Rivara M, Rodriguez P, Montenegro R and Jorquera G (2012). Multithread parallelization of Lepp-bisection algorithms, Applied Numerical Mathematics, 62:4, (473-488), Online publication date: 1-Apr-2012.
- Santos B and Macedo H (2012). Improving CUDA™ C/C++ encoding readability to foster parallel application development, ACM SIGSOFT Software Engineering Notes, 37:1, (1-5), Online publication date: 27-Jan-2012.
- Pu Y, Bodik R and Srivastava S Synthesis of first-order dynamic programming algorithms Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications, (83-98)
- Pu Y, Bodik R and Srivastava S (2011). Synthesis of first-order dynamic programming algorithms, ACM SIGPLAN Notices, 46:10, (83-98), Online publication date: 18-Oct-2011.
- Thompson H and Chadhuri P (2011). An alternative visual analysis of the build heap algorithm, ACM Inroads, 2:3, (31-32), Online publication date: 31-Aug-2011.
- Willmott A Rapid simplification of multi-attribute meshes Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics, (151-158)
- Bell T and Aspvall B Sorting algorithms as special cases of a priority queue sort Proceedings of the 42nd ACM technical symposium on Computer science education, (123-128)
- Gafni E and Rajsbaum S Recursion in distributed computing Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems, (362-376)
- Lai P and Fu H (2010). A polygon description based similarity measurement of stock market behavior, Expert Systems with Applications: An International Journal, 37:2, (1113-1123), Online publication date: 1-Mar-2010.
- Towfic F, Greenlee M and Honavar V Aligning biomolecular networks using modular graph kernels Proceedings of the 9th international conference on Algorithms in bioinformatics, (345-361)
- Kittipiyakul S and Javidi T (2019). Delay-optimal server allocation in multiqueue multiserver systems with time-varying connectivities, IEEE Transactions on Information Theory, 55:5, (2319-2333), Online publication date: 1-May-2009.
- Wu X (2008). Efficient intensity map splitting algorithms for intensity-modulated radiation therapy, Information Processing Letters, 106:5, (188-194), Online publication date: 1-May-2008.
- Ginat D Learning from wrong and creative algorithm design Proceedings of the 39th SIGCSE technical symposium on Computer science education, (26-30)
- Polycarpou I, Pasztor A and Adjouadi M A conceptual approach to teaching induction for computer science Proceedings of the 39th SIGCSE technical symposium on Computer science education, (9-13)
- Ginat D (2008). Learning from wrong and creative algorithm design, ACM SIGCSE Bulletin, 40:1, (26-30), Online publication date: 29-Feb-2008.
- Polycarpou I, Pasztor A and Adjouadi M (2008). A conceptual approach to teaching induction for computer science, ACM SIGCSE Bulletin, 40:1, (9-13), Online publication date: 29-Feb-2008.
- Yin Z and Chiang J (2008). Novel Algorithm for Coexpression Detection in Time-Varying Microarray Data Sets, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 5:1, (120-135), Online publication date: 1-Jan-2008.
- Baudet C and Dias Z New EST trimming procedure applied to SUCEST sequences Proceedings of the 2nd Brazilian conference on Advances in bioinformatics and computational biology, (57-68)
- Berberich K, Bedathur S, Neumann T and Weikum G A time machine for text search Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, (519-526)
- Ginat D (2007). Hasty design, futile patching and the elaboration of rigor, ACM SIGCSE Bulletin, 39:3, (161-165), Online publication date: 25-Jun-2007.
- Ginat D Hasty design, futile patching and the elaboration of rigor Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education, (161-165)
- Helmer S An Interval-Based Index Structure for Structure Elucidation in Chemical Databases Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing, (625-634)
- Williams D and Lutfiyya H (2018). Fault-tolerant authentication services, International Journal of Computers and Applications, 29:2, (107-114), Online publication date: 1-Mar-2007.
- Zhu L, Yao Y, Zhou S and Dong S (2007). A heuristic optimal discrete bit allocation algorithm for margin maximization in DMT systems, EURASIP Journal on Advances in Signal Processing, 2007:1, (1-1), Online publication date: 1-Jan-2007.
- Ginat D (2006). Hidden squares, ACM SIGCSE Bulletin, 38:4, (22-23), Online publication date: 1-Dec-2006.
- Ardagna D, Cappiello C, Francalanci C and Groppi A Brokering multisource data with quality constraints Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I, (807-817)
- Menezes T, Tedesco P and Ramalho G Negotiator agents for the patrolling task Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence, (48-57)
- Sloper C and Telle J Towards a taxonomy of techniques for designing parameterized algorithms Proceedings of the Second international conference on Parameterized and Exact Computation, (251-263)
- Ginat D Hidden squares Working group reports on ITiCSE on Innovation and technology in computer science education, (22-23)
- Lobo A and Baliga G (2006). NP-completeness for all computer science undergraduates, Journal of Computing Sciences in Colleges, 21:6, (53-63), Online publication date: 1-Jun-2006.
- Semé D A CGM algorithm solving the longest increasing subsequence problem Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V, (10-21)
- Bihler P, Brunie L and Scuturici V Modeling user intention in pervasive service environments Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing, (977-986)
- Assiter K (2005). Accessibility of Analysis of Algorithms, Journal of Computing Sciences in Colleges, 21:2, (185-194), Online publication date: 1-Dec-2005.
- Misiołek E and Chen D Efficient Algorithms for Simplifying Flow Networks Proceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 3595, (737-746)
- Melo C and da Fonseca N (2005). Envelope process and computation of the equivalent bandwidth of multifractal flows, Computer Networks: The International Journal of Computer and Telecommunications Networking, 48:3, (351-375), Online publication date: 21-Jun-2005.
- Yang I, Huang C and Chao K (2005). A fast algorithm for computing a longest common increasing subsequence, Information Processing Letters, 93:5, (249-253), Online publication date: 1-Mar-2005.
- Lingras P and Huang X (2005). Statistical, Evolutionary, and Neurocomputing Clustering Techniques, Artificial Intelligence Review, 23:1, (3-29), Online publication date: 1-Mar-2005.
- Vega Lopez I, Snodgrass R and Moon B (2005). Spatiotemporal Aggregate Computation, IEEE Transactions on Knowledge and Data Engineering, 17:2, (271-286), Online publication date: 1-Feb-2005.
- Bruce K (2004). Controversy on how to teach CS 1, ACM SIGCSE Bulletin, 36:4, (29-34), Online publication date: 1-Dec-2004.
- Valiente G (2019). Trading uninitialized space for time, Information Processing Letters, 92:1, (9-13), Online publication date: 16-Oct-2004.
- Bruce K Controversy on how to teach CS 1 Working group reports from ITiCSE on Innovation and technology in computer science education, (29-34)
- Verykios V and Moustakides G A generalized cost optimal decision model for record matching Proceedings of the 2004 international workshop on Information quality in information systems, (20-26)
- Ginat D (2004). Algorithmic patterns and the case of the sliding delta, ACM SIGCSE Bulletin, 36:2, (29-33), Online publication date: 1-Jun-2004.
- Roussos C Teaching growth of functions using equivalence classes Proceedings of the 35th SIGCSE technical symposium on Computer science education, (170-174)
- Roussos C (2004). Teaching growth of functions using equivalence classes, ACM SIGCSE Bulletin, 36:1, (170-174), Online publication date: 1-Mar-2004.
- Ding J, Tseng S and Huang Y (2019). Packet Permutation, Multimedia Tools and Applications, 21:3, (281-305), Online publication date: 1-Dec-2003.
- Chen D, Daescu O, Hu X and Xu J (2003). Finding an optimal path without growing the tree, Journal of Algorithms, 49:1, (13-41), Online publication date: 1-Oct-2003.
- Moon B, Fernando Vega Lopez I and Immanuel V (2003). Efficient Algorithms for Large-Scale Temporal Aggregation, IEEE Transactions on Knowledge and Data Engineering, 15:3, (744-759), Online publication date: 1-Mar-2003.
- Horowitz E Algorithms, design and classification of Encyclopedia of Computer Science, (45-51)
- Shieh W, Chen T, Shann J and Chung C (2003). Inverted file compression through document identifier reassignment, Information Processing and Management: an International Journal, 39:1, (117-131), Online publication date: 1-Jan-2003.
- Indulska M and Orlowska M Gravity based spatial clustering Proceedings of the 10th ACM international symposium on Advances in geographic information systems, (125-130)
- Aho I (2019). New polynomial-time instances to various knapsack-type problems, Fundamenta Informaticae, 53:3-4, (199-228), Online publication date: 1-Aug-2002.
- De Carvalho F, Lins R and Lima R Translating Haskell# programs into Petri nets Proceedings of the 5th international conference on High performance computing for computational science, (635-649)
- Aho I (2002). New polynomial-time instances to various knapsack-type problems, Fundamenta Informaticae, 53:3,4, (199-228), Online publication date: 30-May-2002.
- Li K Performance Evaluation of a Random-Walk-Based Algorithm for Embedding Dynamically Evolving Trees in Butterflies Proceedings of the 16th International Parallel and Distributed Processing Symposium
- Carvalho F, Lima R and Lins R Coordinating functional processes with Haskell# Proceedings of the 2002 ACM symposium on Applied computing, (393-400)
- Ginat D (2002). On varying perspectives of problem decomposition, ACM SIGCSE Bulletin, 34:1, (331-335), Online publication date: 1-Mar-2002.
- Ginat D On varying perspectives of problem decomposition Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (331-335)
- (2001). Spatial Similarity Retrieval in Video Databases, Journal of Visual Communication and Image Representation, 12:2, (107-122), Online publication date: 1-Jun-2001.
- Jeffery C Goal-directed object-oriented programming in Unicon Proceedings of the 2001 ACM symposium on Applied computing, (306-308)
- Ginat D, Garcia D, Astrachan O and Bergin J (2001). Colorful illustrations of algorithmic design techniques and problem solving, ACM SIGCSE Bulletin, 33:1, (425-426), Online publication date: 1-Mar-2001.
- Ginat D (2001). Misleading intuition in algorithmic problem solving, ACM SIGCSE Bulletin, 33:1, (21-25), Online publication date: 1-Mar-2001.
- Lee C, Shih C and Chen Y (2001). Optimizing Large Join Queries Using A Graph-Based Approach, IEEE Transactions on Knowledge and Data Engineering, 13:2, (298-315), Online publication date: 1-Mar-2001.
- Ginat D, Garcia D, Astrachan O and Bergin J Colorful illustrations of algorithmic design techniques and problem solving Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education, (425-426)
- Ginat D Misleading intuition in algorithmic problem solving Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education, (21-25)
- Oliveira S (2000). Exact Prediction of QR Fill-In by Row-Merge Trees, SIAM Journal on Scientific Computing, 22:6, (1962-1973), Online publication date: 1-Jan-2001.
- Brest J, Vreže A and Žumer V A sorting algorithm on a PC cluster Proceedings of the 2000 ACM symposium on Applied computing - Volume 2, (710-715)
- Hendrickson B and Kolda T (1999). Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing, SIAM Journal on Scientific Computing, 21:6, (2048-2072), Online publication date: 1-Jan-2000.
- Levitin A Do we teach the right algorithm design techniques? The proceedings of the thirtieth SIGCSE technical symposium on Computer science education, (179-183)
- Levitin A (1999). Do we teach the right algorithm design techniques?, ACM SIGCSE Bulletin, 31:1, (179-183), Online publication date: 1-Mar-1999.
- Rothberg E and Schreiber R (1999). Efficient Methods for Out-of-Core Sparse Cholesky Factorization, SIAM Journal on Scientific Computing, 21:1, (129-144), Online publication date: 1-Jan-1999.
- Wang F and Xu J (1999). A Crosswind Block Iterative Method for Convection-Dominated Problems, SIAM Journal on Scientific Computing, 21:2, (620-645), Online publication date: 1-Jan-1999.
- Eyck J, Sampath G and Goldstone R (1998). Specification of an algorithm design system, ACM SIGCSE Bulletin, 30:3, (232-235), Online publication date: 1-Sep-1998.
- Eyck J, Sampath G and Goldstone R Specification of an algorithm design system Proceedings of the 6th annual conference on the teaching of computing and the 3rd annual conference on Integrating technology into computer science education: Changing the delivery of computer science education, (232-235)
- Eggen R Key addressable data storage Proceedings of the 36th annual Southeast regional conference, (189-193)
- Pruhs K (1998). How to design dynamic programming algorithms sans recursion, ACM SIGACT News, 29:1, (32-35), Online publication date: 1-Mar-1998.
- Goodrich M and Tamassia R (1998). Teaching the analysis of algorithms with visual proofs, ACM SIGCSE Bulletin, 30:1, (207-211), Online publication date: 1-Mar-1998.
- Goodrich M and Tamassia R Teaching the analysis of algorithms with visual proofs Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education, (207-211)
- Li K Performance evaluation of probabilistic tree embedding in cube-connected cycles Proceedings of the 1998 ACM symposium on Applied Computing, (584-592)
- Morano E, Mavriplis D and Venkatakrishnan V (1998). Coarsening Strategies for Unstructured Multigrid Techniques with Application to Anisotropic Problems, SIAM Journal on Scientific Computing, 20:2, (393-415), Online publication date: 1-Jan-1998.
- Manske K and Mühlhäuser M An open architecture for comic actor animation Proceedings of the fifth ACM international conference on Multimedia, (251-259)
- Saab Y (1997). Combinatorial Optimization by Dynamic Contraction, Journal of Heuristics, 3:3, (207-224), Online publication date: 1-Nov-1997.
- Kuo T and Hwang S (1997). Using Disruptive Selection to Maintain Diversity in GeneticAlgorithms, Applied Intelligence, 7:3, (257-267), Online publication date: 1-Jul-1997.
- Xiang Y, Wong S and Cercone N (2019). A “Microscopic” Study of Minimum Entropy Search in Learning Decomposable Markov Networks, Machine Language, 26:1, (65-92), Online publication date: 1-Jan-1997.
- Fleischer M Simulated annealing Proceedings of the 27th conference on Winter simulation, (155-161)
- Baeza-Yates R (2019). Teaching algorithms, ACM SIGACT News, 26:4, (51-59), Online publication date: 1-Dec-1995.
- McCloskey R and Beidler J (1995). An analysis of algorithms laboratory utilizing the maximum segment sum problem, ACM SIGCSE Bulletin, 27:4, (21-26), Online publication date: 1-Dec-1995.
- Sultan Alam M and Melhem R (1995). Routing in Modular Fault-Tolerant Multiprocessor Systems, IEEE Transactions on Parallel and Distributed Systems, 6:11, (1206-1220), Online publication date: 1-Nov-1995.
- Louri A, Hatch Jr. J and Na J (1995). A Constant-Time Parallel Sorting Algorithm and Its Optical Implementation, IEEE Micro, 15:3, (60-71), Online publication date: 1-Jun-1995.
- Liang Y (1995). Teaching dynamic programming techniques using permutation graphs, ACM SIGCSE Bulletin, 27:1, (56-60), Online publication date: 15-Mar-1995.
- Liang Y Teaching dynamic programming techniques using permutation graphs Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, (56-60)
- King D and Launchbury J Structuring depth-first search algorithms in Haskell Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (344-354)
- Kortright L (1994). From specific problem instances to algorithms in the introductory course, ACM SIGCSE Bulletin, 26:1, (71-75), Online publication date: 12-Mar-1994.
- Kortright L From specific problem instances to algorithms in the introductory course Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, (71-75)
- Biernat M (1993). Teaching tools for data structures and algorithms, ACM SIGCSE Bulletin, 25:4, (9-12), Online publication date: 1-Dec-1993.
- Lieberherr K and Xiao C (2018). Formal Foundations for Object-Oriented Data Modeling, IEEE Transactions on Knowledge and Data Engineering, 5:3, (462-478), Online publication date: 1-Jun-1993.
- Strate S and Wainwright R Load balancing techniques for dynamic programming algorithms on hypercube multiprocessors Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (562-569)
- Rajasekaran S and Ross K (1993). Fast algorithms for generating discrete random variates with changing distributions, ACM Transactions on Modeling and Computer Simulation (TOMACS), 3:1, (1-19), Online publication date: 2-Jan-1993.
- Li J Improvements to systematic program development Proceedings of the 30th annual Southeast regional conference, (308-311)
- Berghel H, Roach D, Balogh G and Hyatt C “Tuning” an ASM metric Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's, (131-136)
- Astrachan O (1991). Pictures as invariants, ACM SIGCSE Bulletin, 23:1, (112-118), Online publication date: 1-Mar-1991.
- Astrachan O Pictures as invariants Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, (112-118)
- Gerasoulis A, Venugopal S and Yang T (1990). Clustering task graphs for message passing architectures, ACM SIGARCH Computer Architecture News, 18:3b, (447-456), Online publication date: 1-Sep-1990.
- Gerasoulis A, Venugopal S and Yang T Clustering task graphs for message passing architectures Proceedings of the 4th international conference on Supercomputing, (447-456)
- Henderson P Discrete mathematics as a precursor to programming Proceedings of the twenty-first SIGCSE technical symposium on Computer science education, (17-21)
- Henderson P (1990). Discrete mathematics as a precursor to programming, ACM SIGCSE Bulletin, 22:1, (17-21), Online publication date: 1-Feb-1990.
- Manber U (1988). Using induction to design algorithms, Communications of the ACM, 31:11, (1300-1313), Online publication date: 1-Nov-1988.
Index Terms
- Introduction to Algorithms: A Creative Approach
Recommendations
Guest Editors’ Introduction: Computer Science in the Liberal Arts
For many people, computer science is not closely associated with the liberal arts. Yet “liberal arts” can denote a philosophy of education that emphasizes broadly preparing students for all aspects of their future lives, and as computing becomes more ...
Unplugging Evolutionary Algorithms: an experiment on human-algorithmic creativity
Understanding and emulating human creativity is a key factor when developing computer based algorithms devoted to art. This paper presents a new evolutionary approach to art and creativity aimed at comprehending human principles and motivations, ...