Skip header Section
Skip Bibliometrics Section
Algorithmics: theory & practiceApril 1988
- Authors:
- Gilles Brassard,
- Paul Bratley
Abstract
No abstract available.
Cited By
- Hashim S and Benaissa M Accelerating Integer Based Fully Homomorphic Encryption Using Frequency Domain Multiplication Information and Communications Security, (161-176)
Hwang H, Janson S and Tsai T (2017). Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half, ACM Transactions on Algorithms, 13:4, (1-43), Online publication date: 31-Oct-2017.- Hamood M and Boussakta S (2014). Efficient algorithms for computing the new Mersenne number transform, Digital Signal Processing, 25:C, (280-288), Online publication date: 1-Feb-2014.
- Luckow K, Păsăreanu C, Dwyer M, Filieri A and Visser W Exact and approximate probabilistic symbolic execution for nondeterministic programs Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering, (575-586)
- MartíN J, Mayor G and Valero O (2011). On aggregation of normed structures, Mathematical and Computer Modelling: An International Journal, 54:1-2, (815-827), Online publication date: 1-Jul-2011.
- Desmedt Y Encryption schemes Algorithms and theory of computation handbook, (10-10)
- David J, Kalach K and Tittley N (2007). Hardware Complexity of Modular Multiplication and Exponentiation, IEEE Transactions on Computers, 56:10, (1308-1319), Online publication date: 1-Oct-2007.
- Hernández-Lobato D, Martínez-Muñoz G and Suárez A Out of bootstrap estimation of generalization error curves in bagging ensembles Proceedings of the 8th international conference on Intelligent data engineering and automated learning, (47-56)
- Hernández-Lobato D, Martínez-Muñoz G and Suárez A Out of Bootstrap Estimation of Generalization Error Curves in Bagging Ensembles Intelligent Data Engineering and Automated Learning - IDEAL 2007, (47-56)
- Steffen P and Giegerich R (2006). Table design in dynamic programming, Information and Computation, 204:9, (1325-1345), Online publication date: 1-Sep-2006.
- 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.
- Esposito R and Saitta L Experimental comparison between bagging and Monte Carlo ensemble classification Proceedings of the 22nd international conference on Machine learning, (209-216)
- Esposito R and Saitta L A Monte Carlo analysis of ensemble classification Proceedings of the twenty-first international conference on Machine learning
- Giegerich R, Meyer C and Steffen P (2018). A discipline of dynamic programming over sequence data, Science of Computer Programming, 51:3, (215-263), Online publication date: 1-Jun-2004.
- Horowitz E Algorithms, design and classification of Encyclopedia of Computer Science, (45-51)
- Mao W and Nicol D (2019). On k-ary n-cubes, Discrete Applied Mathematics, 129:1, (171-193), Online publication date: 15-Jun-2003.
- Esposito R and Saitta L Monte Carlo theory as an explanation of bagging and boosting Proceedings of the 18th international joint conference on Artificial intelligence, (499-504)
- Giordana A and Saitta L (2019). Phase Transitions in Relational Learning, Machine Language, 41:2, (217-251), Online publication date: 1-Nov-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.
- Giordana A, Botta M and Saitta L An experimental study of phase transitions in matching Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2, (1198-1203)
- Coddington P and Ko S Techniques for empirical testing of parallel random number generators Proceedings of the 12th international conference on Supercomputing, (282-288)
- Nicol D, Simha R and Towsley D (1996). Static Assignment of Stochastic Tasks Using Majorization, IEEE Transactions on Computers, 45:6, (730-740), Online publication date: 1-Jun-1996.
- Abd-El-Hafiz S and Basili V (1996). A Knowledge-Based Approach to the Analysis of Loops, IEEE Transactions on Software Engineering, 22:5, (339-360), Online publication date: 1-May-1996.
- (1996). Combined Multiple Recursive Random Number Generators, Operations Research, 44:5, (816-822), Online publication date: 1-Oct-1996.
- Baeza-Yates R (2019). Teaching algorithms, ACM SIGACT News, 26:4, (51-59), Online publication date: 1-Dec-1995.
- Bertino E, Salerno S and Shidlovsky B Enhanced nested-inherited index for OODBMS Proceedings of the fourth international conference on Information and knowledge management, (58-65)
- Gudaitis M, Lamont G and Terzuoli A Multicriteria vehicle route-planning using parallel A * search Proceedings of the 1995 ACM symposium on Applied computing, (171-176)
- Yang L and Jin L (1995). Integrating parallel algorithm design with parallel machine models, ACM SIGCSE Bulletin, 27:1, (131-135), Online publication date: 15-Mar-1995.
- Yang L and Jin L Integrating parallel algorithm design with parallel machine models Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, (131-135)
- Heck P Dynamic programming for pennies a day Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, (213-217)
- Heck P (1994). Dynamic programming for pennies a day, ACM SIGCSE Bulletin, 26:1, (213-217), Online publication date: 12-Mar-1994.
- Rogers D and Unger E A deterrent to linear system inferential attacks using a mediator Proceedings of the 1994 ACM symposium on Applied computing, (15-19)
- Gupta R, Smolka S and Bhaskar S (1994). On randomization in sequential and distributed algorithms, ACM Computing Surveys (CSUR), 26:1, (7-86), Online publication date: 1-Mar-1994.
- Sasinowski J and Strosnider J (2019). A Dynamic Programming Algorithm for Cache Memory Partitioning for Real-Time Systems, IEEE Transactions on Computers, 42:8, (997-1001), Online publication date: 1-Aug-1993.
- Erbas C, Sarkeshik S and Tanik M Different perspectives of the N-Queens problem Proceedings of the 1992 ACM annual conference on Communications, (99-108)
- Cole R Tight bounds on the complexity of the Boyer-Moore string matching algorithm Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, (224-233)
- Tompa M (1990). Figures of merit: the sequel, ACM SIGACT News, 21:4, (78-81), Online publication date: 1-Nov-1990.
- L'Ecuyer P (1990). Random numbers for simulation, Communications of the ACM, 33:10, (85-97), Online publication date: 1-Oct-1990.
- Khanna A A distributed algorithm for generation of the Kth best spanning tree Proceedings of the 28th annual Southeast regional conference, (261-266)
- Tompa M (1989). Figures of merit, ACM SIGACT News, 20:1, (62-71), Online publication date: 1-Jan-1989.
- Navathe S and Ra M (1989). Vertical partitioning for database design: a graphical algorithm, ACM SIGMOD Record, 18:2, (440-450), Online publication date: 1-Jun-1989.
- Navathe S and Ra M Vertical partitioning for database design: a graphical algorithm Proceedings of the 1989 ACM SIGMOD international conference on Management of data, (440-450)
- Brassard G (1985). Crusade for a better notation, ACM SIGACT News, 17:1, (60-64), Online publication date: 1-Jun-1985.
Index Terms
- Algorithmics: theory & practice
Recommendations
Algorithmics
Encyclopedia of Computer ScienceAlgorithmics is the systematic study of algorithms--how to devise them, describe them, validate them, and compare their relative merits. As the study of algorithms, algorithmics might be deemed a synonym for computer science. And, to be sure, "...
What Do We Learn from Experimental Algorithmics?
MFCS '00: Proceedings of the 25th International Symposium on Mathematical Foundations of Computer ScienceExperimental Algorithmics is concerned with the design, implementation, tuning, debugging and performance analysis of computer programs for solving algorithmic problems. It provides methodologies and tools for designing, developing and experimentally ...