skip to main content
Skip header Section
Concrete Mathematics: A Foundation for Computer ScienceJanuary 1994
Publisher:
  • Addison-Wesley Longman Publishing Co., Inc.
  • 75 Arlington Street, Suite 300 Boston, MA
  • United States
ISBN:978-0-201-55802-9
Published:01 January 1994
Pages:
672
Skip Bibliometrics Section
Bibliometrics
Skip Abstract Section
Abstract

From the Publisher: This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data. It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline. Concrete Mathematics is a blending of CONtinuous and disCRETE mathematics. "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems." The subject matter is primarily an expansion of the Mathematical Preliminaries section in Knuth's classic Art of Computer Programming, but the style of presentation is more leisurely, and individual topics are covered more deeply. Several new topics have been added, and the most significant ideas have been traced to their historical roots. The book includes more than 500 exercises, divided into six categories. Complete answers are provided for all exercises, except research problems, making the book particularly valuable for self-study. Major topics include: Sums Recurrences Integer functions Elementary number theory Binomial coefficients Generating functions Discrete probability Asymptotic methods This second edition includes important new material about mechanical summation. In response to the widespread use ofthe first edition as a reference book, the bibliography and index have also been expanded, and additional nontrivial improvements can be found on almost every page. Readers will appreciate the informal style of Concrete Mathematics. Particularly enjoyable are the marginal graffiti contributed by students who have taken courses based on this material. The authors want to convey not only the importance of the techniques presented, but some of the fun in learning and using them.

Cited By

  1. Levin K and Betancourt B (2024). Fast generation of exchangeable sequences of clusters data, Statistics and Computing, 34:2, Online publication date: 1-Apr-2024.
  2. Gribanov D, Shumilov I, Malyshev D and Pardalos P (2024). On -modular integer linear problems in the canonical form and equivalent problems, Journal of Global Optimization, 88:3, (591-651), Online publication date: 1-Mar-2024.
  3. Reitzig R and Wild S (2024). A simple and fast linear-time algorithm for divisor methods of apportionment, Mathematical Programming: Series A and B, 203:1-2, (187-205), Online publication date: 1-Jan-2024.
  4. Einolf T, Muth R and Wilkinson J (2023). Injectively -Colored Rooted Forests, Graphs and Combinatorics, 39:5, Online publication date: 1-Oct-2023.
  5. Teboulle M and Vaisbourd Y (2023). An elementary approach to tight worst case complexity analysis of gradient based methods, Mathematical Programming: Series A and B, 201:1-2, (63-96), Online publication date: 1-Sep-2023.
  6. Mattson H (2023). On restricted partitions of numbers, Applicable Algebra in Engineering, Communication and Computing, 34:5, (751-791), Online publication date: 1-Sep-2023.
  7. Imre J and Jeffrey D Non-principal Branches of Lambert W. A Tale of 2 Circles Computer Algebra in Scientific Computing, (199-212)
  8. Hewasinghage M, Nadal S, Abelló A and Zimányi E (2023). Automated database design for document stores with multicriteria optimization, Knowledge and Information Systems, 65:7, (3045-3078), Online publication date: 1-Jul-2023.
  9. ACM
    Avanzini M, Moser G and Schaper M (2023). Automated Expected Value Analysis of Recursive Programs, Proceedings of the ACM on Programming Languages, 7:PLDI, (1050-1072), Online publication date: 6-Jun-2023.
  10. Peng C, Dong Y and Fan T (2023). The first-passage-time moments for the Hougaard process and its Birnbaum–Saunders approximation, Statistics and Computing, 33:3, Online publication date: 1-Jun-2023.
  11. Deshpande P, Menon K and Sarkar W (2023). Refinements of the braid arrangement and two-parameter Fuss–Catalan numbers, Journal of Algebraic Combinatorics: An International Journal, 57:3, (687-707), Online publication date: 1-May-2023.
  12. Heuberger C, Krenn D and Lipnik G (2022). Asymptotic Analysis of q-Recursive Sequences, Algorithmica, 84:9, (2480-2532), Online publication date: 1-Sep-2022.
  13. Pang S, Lv L and Deng X (2021). Decomposition and Merging Algorithms for Noncrossing Forests, Graphs and Combinatorics, 38:1, Online publication date: 1-Feb-2022.
  14. Roffo G, Melzi S, Castellani U, Vinciarelli A and Cristani M (2021). Infinite Feature Selection: A Graph-based Feature Filtering Approach, IEEE Transactions on Pattern Analysis and Machine Intelligence, 43:12, (4396-4410), Online publication date: 1-Dec-2021.
  15. ACM
    Das S and Kapelko R (2021). On the Range Assignment in Wireless Sensor Networks for Minimizing the Coverage-Connectivity Cost, ACM Transactions on Sensor Networks, 17:4, (1-48), Online publication date: 30-Nov-2021.
  16. ACM
    Aumüller M, Lebeda C and Pagh R Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, (1223-1236)
  17. Sawada J, Williams A and Wong D Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order Combinatorics on Words, (172-184)
  18. ACM
    Lukes D, Sarracino J, Coleman C, Peleg H, Lerner S and Polikarpova N Synthesis of web layouts from examples Proceedings of the 29th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, (651-663)
  19. Bestehorn F, Hansknecht C, Kirches C and Manns P (2021). Mixed-integer optimal control problems with switching costs: a shortest path approach, Mathematical Programming: Series A and B, 188:2, (621-652), Online publication date: 1-Aug-2021.
  20. ACM
    Lin T, Lu C and Tan T Towards a more efficient approach for the satisfiability of two-variable logic Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (1-13)
  21. Klinkenberg L, Batz K, Kaminski B, Katoen J, Moerman J and Winkler T Generating Functions for Probabilistic Programs Logic-Based Program Synthesis and Transformation, (231-248)
  22. Sehrawat V and Desmedt Y Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families Computing and Combinatorics, (246-261)
  23. Gopinathan K and Sergey I Certifying Certainty and Uncertainty in Approximate Membership Query Structures Computer Aided Verification, (279-303)
  24. de Boer K, Ducas L and Fehr S On the Quantum Complexity of the Continuous Hidden Subgroup Problem Advances in Cryptology – EUROCRYPT 2020, (341-370)
  25. Ünal A Impossibility Results for Lattice-Based Functional Encryption Schemes Advances in Cryptology – EUROCRYPT 2020, (169-199)
  26. Matera G, Pérez M and Privitelli M (2019). Factorization patterns on nonlinear families of univariate polynomials over a finite field, Journal of Algebraic Combinatorics: An International Journal, 51:1, (103-153), Online publication date: 1-Feb-2020.
  27. Huang C, Xu M and Li Z (2018). A Conflict-Driven Solving Procedure for Poly-Power Constraints, Journal of Automated Reasoning, 64:1, (1-20), Online publication date: 1-Jan-2020.
  28. Matsuta T and Uyematsu T On the Distance Between the Rumor Source and Its Optimal Estimate in a Regular Tree 2019 IEEE International Symposium on Information Theory (ISIT), (2334-2338)
  29. ACM
    Akilal K, Omar M and Slimani H A wider picture of trust Proceedings of the 3rd International Conference on Future Networks and Distributed Systems, (1-5)
  30. Bensouici T, Charef A and Imen A (2019). A Simple Design of Fractional Delay FIR Filter Based on Binomial Series Expansion Theory, Circuits, Systems, and Signal Processing, 38:7, (3356-3369), Online publication date: 1-Jul-2019.
  31. Mezzadri F and Galligani E (2019). Splitting Methods for a Class of Horizontal Linear Complementarity Problems, Journal of Optimization Theory and Applications, 180:2, (500-517), Online publication date: 1-Feb-2019.
  32. Gavenčiak T, Geissmann B and Lengler J (2019). Sorting by Swaps with Noisy Comparisons, Algorithmica, 81:2, (796-827), Online publication date: 1-Feb-2019.
  33. ACM
    Eberl M Verified solving and asymptotics of linear recurrences Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, (27-37)
  34. Dance C and Silander T (2021). Optimal policies for observing time series and related restless bandit problems, The Journal of Machine Learning Research, 20:1, (1218-1310), Online publication date: 1-Jan-2019.
  35. Lee D, Yang M and Oh S (2018). Head and Body Orientation Estimation Using Convolutional Random Projection Forests, IEEE Transactions on Pattern Analysis and Machine Intelligence, 41:1, (107-120), Online publication date: 1-Jan-2019.
  36. Reitzig R and Wild S (2018). Building Fences Straight and High, Algorithmica, 80:11, (3365-3396), Online publication date: 1-Nov-2018.
  37. ACM
    Chan T, Huang Z, Jiang S, Kang N and Tang Z (2018). Online Submodular Maximization with Free Disposal, ACM Transactions on Algorithms, 14:4, (1-29), Online publication date: 31-Oct-2018.
  38. ACM
    Padhi S, Jain P, Perelman D, Polozov O, Gulwani S and Millstein T (2018). FlashProfile: a framework for synthesizing data profiles, Proceedings of the ACM on Programming Languages, 2:OOPSLA, (1-28), Online publication date: 24-Oct-2018.
  39. Oikonomou A and Symvonis A Monotone Drawings of k-Inner Planar Graphs Graph Drawing and Network Visualization, (347-353)
  40. Aminof B, Kotek T, Rubin S, Spegni F and Veith H (2018). Parameterized model checking of rendezvous systems, Distributed Computing, 31:3, (187-222), Online publication date: 1-Jun-2018.
  41. ACM
    Chung S Provably correct posit arithmetic with fixed-point big integer Proceedings of the Conference for Next Generation Arithmetic, (1-10)
  42. ACM
    Melzi S, Ovsjanikov M, Roffo G, Cristani M and Castellani U (2018). Discrete Time Evolution Process Descriptor for Shape Analysis and Matching, ACM Transactions on Graphics, 37:1, (1-18), Online publication date: 28-Feb-2018.
  43. Tagasovska N and Andritsos P (2017). Distributed clustering of categorical data using the information bottleneck framework, Information Systems, 72:C, (161-178), Online publication date: 1-Dec-2017.
  44. Karzand M, Leith D, Cloud J and Médard M (2017). Design of FEC for Low Delay in 5G, IEEE Journal on Selected Areas in Communications, 35:8, (1783-1793), Online publication date: 1-Aug-2017.
  45. ACM
    Clausen M and Hühne P Linear Time Fourier Transforms of S-invariant Functions on the Symmetric Group S Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, (101-108)
  46. Raviv N, Schwartz M and Yaakobi E Rank modulation codes for DNA storage 2017 IEEE International Symposium on Information Theory (ISIT), (3125-3129)
  47. Nozaki T, Nakano T and Wadayama T Analysis of breakdown probability of wireless sensor networks with unreliable relay nodes 2017 IEEE International Symposium on Information Theory (ISIT), (481-485)
  48. ACM
    Horst C, Kikuchi R and Xagawa K Cryptanalysis of Comparable Encryption in SIGMOD'16 Proceedings of the 2017 ACM International Conference on Management of Data, (1069-1084)
  49. Casajus A and Wiese H (2017). Scarcity, competition, and value, International Journal of Game Theory, 46:2, (295-310), Online publication date: 1-May-2017.
  50. Eedara P, Li H, Janakiraman N, Tungala N, Chamberland J and Huff G (2017). Occupancy Estimation With Wireless Monitoring Devices and Application-Specific Antennas, IEEE Transactions on Signal Processing, 65:8, (2123-2135), Online publication date: 1-Apr-2017.
  51. Comin C and Rizzi R (2017). Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games, Algorithmica, 77:4, (995-1021), Online publication date: 1-Apr-2017.
  52. ACM
    Alaggan M, Cunche M and Minier M Non-interactive (t, n)-Incidence Counting from Differentially Private Indicator Vectors Proceedings of the 3rd ACM on International Workshop on Security And Privacy Analytics, (1-9)
  53. Cartis C and Thompson A (2017). Quantitative Recovery Conditions for Tree-Based Compressed Sensing, IEEE Transactions on Information Theory, 63:3, (1555-1571), Online publication date: 1-Mar-2017.
  54. ACM
    Wang F (2017). Proof of a series solution for euler's trinomial equation, ACM Communications in Computer Algebra, 50:4, (136-144), Online publication date: 22-Feb-2017.
  55. Jansen K and Klein K About the structure of the integer cone and its application to bin packing Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (1571-1581)
  56. Rubinstein A and Vardi S Sorting from noisier samples Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (960-972)
  57. Nathanson M (2017). Free monoids and forests of rational numbers, Discrete Applied Mathematics, 216:P3, (662-669), Online publication date: 10-Jan-2017.
  58. Ecevit F and Özen H (2017). Frequency-adapted Galerkin boundary element methods for convex scattering problems, Numerische Mathematik, 135:1, (27-71), Online publication date: 1-Jan-2017.
  59. ACM
    Aumüller M, Dietzfelbinger M and Klaue P (2016). How Good Is Multi-Pivot Quicksort?, ACM Transactions on Algorithms, 13:1, (1-47), Online publication date: 21-Dec-2016.
  60. Yu H, Rao N and Dhillon I Temporal regularized matrix factorization for high-dimensional time series prediction Proceedings of the 30th International Conference on Neural Information Processing Systems, (847-855)
  61. Wang J, Zhu H, Dai L, Gomes N and Wang J (2016). Low-Complexity Beam Allocation for Switched-Beam Based Multiuser Massive MIMO Systems, IEEE Transactions on Wireless Communications, 15:12, (8236-8248), Online publication date: 1-Dec-2016.
  62. Diekert V, Myasnikov A and Weiβ A (2016). Conjugacy in Baumslag's Group, Generic Case Complexity, and Division in Power Circuits, Algorithmica, 76:4, (961-988), Online publication date: 1-Dec-2016.
  63. Khalansky D, Lazdin A and Mouromtsev D Creation of a static analysis algorithm using ad hoc programming languages Proceedings of the 19th Conference of Open Innovations Association FRUCT, (72-79)
  64. Gessel I (2016). Lagrange inversion, Journal of Combinatorial Theory Series A, 144:C, (212-249), Online publication date: 1-Nov-2016.
  65. Kapelko R and Kranakis E (2016). On the displacement for covering a unit interval with randomly placed sensors, Information Processing Letters, 116:11, (710-717), Online publication date: 1-Nov-2016.
  66. Rastegin A (2016). Notes on use of Generalized Entropies in Counting, Graphs and Combinatorics, 32:6, (2625-2641), Online publication date: 1-Nov-2016.
  67. Yu Y and Zhang J Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN Proceedings, Part I, of the 36th Annual International Cryptology Conference on Advances in Cryptology --- CRYPTO 2016 - Volume 9814, (214-243)
  68. ACM
    Wen L, Wang K, Shen Y and Lin F (2016). A Model for Phase Transition of Random Answer-Set Programs, ACM Transactions on Computational Logic, 17:3, (1-34), Online publication date: 22-Jul-2016.
  69. Bao J and Ji L (2016). Frequency Hopping Sequences With Optimal Partial Hamming Correlation, IEEE Transactions on Information Theory, 62:6, (3768-3783), Online publication date: 1-Jun-2016.
  70. Yu Y and Steinberger J Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN Proceedings, Part II, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 9666, (154-183)
  71. Mansour T and Shattuck M (2016). Counting permutations by the number of successions within cycles, Discrete Mathematics, 339:4, (1368-1376), Online publication date: 6-Apr-2016.
  72. Vallejos R, Olavarría J and Jara N (2016). Blocking evaluation and analysis of dynamic WDM networks under heterogeneous ON/OFF traffic, Optical Switching and Networking, 20:C, (35-45), Online publication date: 1-Apr-2016.
  73. Sivignon I (2016). A note on the computation of the fraction of smallest denominator in between two irreducible fractions, Discrete Applied Mathematics, 202:C, (197-201), Online publication date: 31-Mar-2016.
  74. Diekert V and Walter T (2015). Asymptotic Approximation for the Quotient Complexities of Atoms, Acta Cybernetica, 22:2, (349-357), Online publication date: 1-Dec-2015.
  75. Lu P, Peng F, Chen H and Zheng L (2015). Deciding determinism of unary languages, Information and Computation, 245:C, (181-196), Online publication date: 1-Dec-2015.
  76. ACM
    Calvin J and Nakayama M (2015). Resampled Regenerative Estimators, ACM Transactions on Modeling and Computer Simulation, 25:4, (1-25), Online publication date: 16-Nov-2015.
  77. Mansour T, Shattuck M and Wagner S (2015). Counting subwords in flattened partitions of sets, Discrete Mathematics, 338:11, (1989-2005), Online publication date: 6-Nov-2015.
  78. Gonzalez O, Beltran C and Santamaria I (2015). On the Number of Interference Alignment Solutions for the $K$ -User MIMO Channel With Constant Coefficients, IEEE Transactions on Information Theory, 61:11, (6028-6048), Online publication date: 1-Nov-2015.
  79. Heuberger C, Kropf S and Wagner S (2015). Variances and covariances in the Central Limit Theorem for the output of a transducer, European Journal of Combinatorics, 49:C, (167-187), Online publication date: 1-Oct-2015.
  80. Kapelko R and Kranakis E On the Displacement for Covering a Square with Randomly Placed Sensors Proceedings of the 14th International Conference on Ad-hoc, Mobile, and Wireless Networks - Volume 9143, (148-162)
  81. ACM
    Diekert V, Myasnikov A and Weiß A Amenability of Schreier Graphs and Strongly Generic Algorithms for the Conjugacy Problem Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, (141-148)
  82. ACM
    Lamine Ba M, Horincar R, Senellart P and Wu H Truth Finding with Attribute Partitioning Proceedings of the 18th International Workshop on Web and Databases, (27-33)
  83. ACM
    Zamanian E, Binnig C and Salama A Locality-aware Partitioning in Parallel Database Systems Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, (17-30)
  84. Chen S, Chyzak F, Feng R, Fu G and Li Z (2015). On the existence of telescopers for mixed hypergeometric terms, Journal of Symbolic Computation, 68:P1, (1-26), Online publication date: 1-May-2015.
  85. Mansour T and Shattuck M (2015). Some results on the avoidance of vincular patterns by multisets, Discrete Applied Mathematics, 181:C, (201-208), Online publication date: 30-Jan-2015.
  86. ACM
    Wild S, Nebel M and Neininger R (2015). Average Case and Distributional Analysis of Dual-Pivot Quicksort, ACM Transactions on Algorithms, 11:3, (1-42), Online publication date: 13-Jan-2015.
  87. Martínez C, Nebel M and Wild S Analysis of branch misses in quicksort Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, (114-128)
  88. Red'ko V, Bui D and Grishko Y (2015). Current State of the Multisets Theory from the Essential Viewpoint, Cybernetics and Systems Analysis, 51:1, (150-156), Online publication date: 1-Jan-2015.
  89. Kranakis E (2014). On the event distance of Poisson processes with applications to sensors, Discrete Applied Mathematics, 179:C, (152-162), Online publication date: 31-Dec-2015.
  90. Hetmaniok E, Lorenc P, Pleszczyński M and Wituła R (2014). Iterated integrals of polynomials, Applied Mathematics and Computation, 249:C, (389-398), Online publication date: 15-Dec-2014.
  91. Guo B and Qi F (2014). Explicit formulae for computing Euler polynomials in terms of Stirling numbers of the second kind, Journal of Computational and Applied Mathematics, 272, (251-257), Online publication date: 1-Dec-2014.
  92. ACM
    Mendes A, Backhouse R and Ferreira J Structure Editing of Handwritten Mathematics Proceedings of the Ninth ACM International Conference on Interactive Tabletops and Surfaces, (139-148)
  93. Panario D, Sahin M, Wang Q and Webb W (2014). General conditional recurrences, Applied Mathematics and Computation, 243, (220-231), Online publication date: 1-Sep-2014.
  94. Cioffi-Revilla C Theoretical Nabladot Analysis of Amdahl's Law for Agent-Based Simulations Revised Selected Papers, Part I, of the Euro-Par 2014 International Workshops on Parallel Processing - Volume 8805, (440-451)
  95. Correa J, Figueroa N, Lederman R and Stier-Moses N (2014). Pricing with markups in industries with increasing marginal costs, Mathematical Programming: Series A and B, 146:1-2, (143-184), Online publication date: 1-Aug-2014.
  96. ACM
    Feng K, Cong G, Bhowmick S and Ma S In search of influential event organizers in online social networks Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, (63-74)
  97. Bruno O and Delourme B (2014). Rapidly convergent two-dimensional quasi-periodic Green function throughout the spectrum-including Wood anomalies, Journal of Computational Physics, 262:C, (262-290), Online publication date: 1-Apr-2014.
  98. Lawrence P and Corless R (2014). Stability of rootfinding for barycentric Lagrange interpolants, Numerical Algorithms, 65:3, (447-464), Online publication date: 1-Mar-2014.
  99. ACM
    Alam M, Khan M and Marathe M Distributed-memory parallel algorithms for generating massive scale-free networks using preferential attachment model Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis, (1-12)
  100. ACM
    Mirolo C and Di Vano D "Welcome to Nimrod" to learn CS ideas in the middle school Proceedings of the 8th Workshop in Primary and Secondary Computing Education, (61-70)
  101. Jin H and Sun L (2013). On Spieß's conjecture on harmonic numbers, Discrete Applied Mathematics, 161:13-14, (2038-2041), Online publication date: 1-Sep-2013.
  102. Mansour T and Shattuck M (2013). A combinatorial approach to a general two-term recurrence, Discrete Applied Mathematics, 161:13-14, (2084-2094), Online publication date: 1-Sep-2013.
  103. Opdyke J (2013). Bootstraps, permutation tests, and sampling orders of magnitude faster using SAS®, WIREs Computational Statistics, 5:5, (391-405), Online publication date: 1-Sep-2013.
  104. ACM
    Varshosaz M and Khosravi R Discrete time Markov chain families Proceedings of the 17th International Software Product Line Conference co-located workshops, (34-41)
  105. Grusea S and Labarre A (2013). The distribution of cycles in breakpoint graphs of signed permutations, Discrete Applied Mathematics, 161:10-11, (1448-1466), Online publication date: 1-Jul-2013.
  106. Krenn D (2013). Analysis of the width-w non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices, Theoretical Computer Science, 491:C, (47-70), Online publication date: 17-Jun-2013.
  107. Inoue K, Aki S and Narayanaswamy B (2013). Generating Functions of Waiting Times and Numbers of Visits for Random Walks on Graphs, Methodology and Computing in Applied Probability, 15:2, (349-362), Online publication date: 1-Jun-2013.
  108. ACM
    Hamzeh M, Shrivastava A and Vrudhula S REGIMap Proceedings of the 50th Annual Design Automation Conference, (1-10)
  109. Rządkowski G (2012). On some expansions for the Euler Gamma function and the Riemann Zeta function, Journal of Computational and Applied Mathematics, 236:15, (3710-3719), Online publication date: 1-Sep-2012.
  110. Backhouse R First-Past-the-Post games Proceedings of the 11th international conference on Mathematics of Program Construction, (157-176)
  111. Burgstaller B, Scholz B and Blieberger J (2012). A symbolic analysis framework for static analysis of imperative programming languages, Journal of Systems and Software, 85:6, (1418-1439), Online publication date: 1-Jun-2012.
  112. ACM
    Gan J, Feng J, Fang Q and Ng W Locality-sensitive hashing scheme based on dynamic collision counting Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, (541-552)
  113. ACM
    Zyto S, Karger D, Ackerman M and Mahajan S Successful classroom deployment of a social document annotation system Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, (1883-1892)
  114. Mahajan M, Saurabh N and Sreenivasaiah K Counting paths in planar width 2 branching programs Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128, (59-68)
  115. Kotek T and Makowsky J (2012). A Representation Theorem for Holonomic Sequences Based on Counting Lattice Paths, Fundamenta Informaticae, 117:1-4, (199-213), Online publication date: 1-Jan-2012.
  116. Heuberger C and Wagner S (2011). The number of maximum matchings in a tree, Discrete Mathematics, 311:21, (2512-2542), Online publication date: 1-Nov-2011.
  117. ACM
    Islam A and Raghunathan V Assessing the viability of cross-layer modeling for asynchronous, multi-hop, ad-hoc wireless mesh networks Proceedings of the 9th ACM international symposium on Mobility management and wireless access, (147-152)
  118. Kautz S and Shutters B Self-assembling rulers for approximating generalized sierpinski carpets Proceedings of the 17th annual international conference on Computing and combinatorics, (284-296)
  119. ACM
    Olsen S and Gooch B Image simplification and vectorization Proceedings of the ACM SIGGRAPH/Eurographics Symposium on Non-Photorealistic Animation and Rendering, (65-74)
  120. Charlier í, Le Gonidec M and Rigo M (2011). Representing real numbers in a generalized numeration system, Journal of Computer and System Sciences, 77:4, (743-759), Online publication date: 1-Jul-2011.
  121. Herrmann C and Hammond K Counter automata for parameterised timing analysis of box-based systems Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis, (126-141)
  122. ACM
    Bertossi A, Navarra A and Pinotti C Maximum bandwidth broadcast in single and multi-interface networks Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication, (1-9)
  123. Miller A and Paris R (2011). Euler-type transformations for the generalized hypergeometric function +2 F +1(x), Zeitschrift für Angewandte Mathematik und Physik (ZAMP), 62:1, (31-45), Online publication date: 1-Feb-2011.
  124. Martinez-Pena J, Torres-Jimenez J, Rangel-Valdez N and Avila-George H A heuristic approach for constructing ternary covering arrays using trinomial coefficients Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence, (572-581)
  125. Hinze R (2010). Concrete stream calculus, Journal of Functional Programming, 20:5-6, (463-535), Online publication date: 1-Nov-2010.
  126. ACM
    Furia C and Rossi M (2010). A theory of sampling for continuous-time metric temporal logic, ACM Transactions on Computational Logic, 12:1, (1-40), Online publication date: 1-Oct-2010.
  127. ACM
    Ker A The square root law does not require a linear key Proceedings of the 12th ACM workshop on Multimedia and security, (213-224)
  128. Kalugin G and Jeffrey D Series transformations to improve and extend convergence Proceedings of the 12th international conference on Computer algebra in scientific computing, (134-147)
  129. Li J and Deshpande A (2010). Ranking continuous probabilistic datasets, Proceedings of the VLDB Endowment, 3:1-2, (638-649), Online publication date: 1-Sep-2010.
  130. Moshkov M (2010). Greedy Algorithm with Weights for Decision Tree Construction, Fundamenta Informaticae, 104:3, (285-292), Online publication date: 1-Aug-2010.
  131. Lutz J and Shutters B Approximate self-assembly of the Sierpinski triangle Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe, (286-295)
  132. Ker A The square root law in stegosystems with imperfect information Proceedings of the 12th international conference on Information hiding, (145-160)
  133. Ferreira J Designing an algorithmic proof of the two-squares theorem Proceedings of the 10th international conference on Mathematics of program construction, (140-156)
  134. Ruskey F and Williams A The feline Josephus problem Proceedings of the 5th international conference on Fun with algorithms, (343-354)
  135. Lapidoth A and Tinguely S (2010). Sending a bivariate Gaussian over a Gaussian MAC, IEEE Transactions on Information Theory, 56:6, (2714-2752), Online publication date: 1-Jun-2010.
  136. Nappi M, Riccio D and De Marsico M Fine Proceedings of the 16th IEEE international conference on Image processing, (245-248)
  137. ACM
    Zhao H, Wang H, Lin B and Xu J Design and performance analysis of a DRAM-based statistics counter array architecture Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, (84-93)
  138. Rastas P A general framework for local pairwise alignment statistics with gaps Proceedings of the 9th international conference on Algorithms in bioinformatics, (233-245)
  139. Uscka-Wehlou H (2009). Two equivalence relations on digital lines with irrational slopes. A continued fraction approach to upper mechanical words, Theoretical Computer Science, 410:38-40, (3655-3669), Online publication date: 1-Sep-2009.
  140. ACM
    Sooriamurthi R (2009). Introducing abstraction and decomposition to novice programmers, ACM SIGCSE Bulletin, 41:3, (196-200), Online publication date: 25-Aug-2009.
  141. Froc G, Mabrouki I and Lagrange X (2009). Design and performance of wireless data gathering networks based on unicast random walk routing, IEEE/ACM Transactions on Networking, 17:4, (1214-1227), Online publication date: 1-Aug-2009.
  142. Zhang L, Wu H and Tan J (2009). Dual bases for Wang-Bézier basis and their applications, Applied Mathematics and Computation, 214:1, (218-227), Online publication date: 1-Aug-2009.
  143. ACM
    Sooriamurthi R Introducing abstraction and decomposition to novice programmers Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education, (196-200)
  144. ACM
    Jovanoviū N, Korst J, Clout R, Pronk V and Tolhuizen L Candle in the woods Proceedings of the twenty-fifth annual symposium on Computational geometry, (148-152)
  145. Atanassov R, Bose P, Couture M, Maheshwari A, Morin P, Paquette M, Smid M and Wuhrer S (2009). Algorithms for optimal outlier removal, Journal of Discrete Algorithms, 7:2, (239-248), Online publication date: 1-Jun-2009.
  146. Tang P, Shoham Y and Lin F Team competition Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1, (241-248)
  147. Huang S and Tzeng C (2009). Distributed edge coloration for bipartite networks, Distributed Computing, 22:1, (3-14), Online publication date: 1-Apr-2009.
  148. Backhouse R and Ferreira J Recounting the Rationals Proceedings of the 9th international conference on Mathematics of Program Construction, (79-91)
  149. Farzan A and Munro J A Uniform Approach Towards Succinct Representation of Trees Proceedings of the 11th Scandinavian workshop on Algorithm Theory, (173-184)
  150. Bar-Noy A, Ladner R and Tamir T (2008). Optimal delay for media-on-demand with pre-loading and pre-buffering, Theoretical Computer Science, 399:1-2, (3-11), Online publication date: 1-Jun-2008.
  151. Boyar J and Peralta R (2008). Tight bounds for the multiplicative complexity of symmetric functions, Theoretical Computer Science, 396:1-3, (223-246), Online publication date: 1-May-2008.
  152. Fenner T, Levene M and Loizou G (2008). Modelling the navigation potential of a web page, Theoretical Computer Science, 396:1-3, (88-96), Online publication date: 1-May-2008.
  153. Chaussard J, Bertrand G and Couprie M Characterizing and detecting toric loops in n-dimensional discrete toric spaces Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery, (129-140)
  154. Mabrouki I, Lagrange X and Froc G Random walk based routing protocol for wireless sensor networks Proceedings of the 2nd international conference on Performance evaluation methodologies and tools, (1-10)
  155. ACM
    Garibay O and Wu A Analyzing the effects of module encapsulation on search space bias Proceedings of the 9th annual conference on Genetic and evolutionary computation, (1234-1241)
  156. Franz M, Meyer B and Pashalidis A Attacking unlinkability Proceedings of the 7th international conference on Privacy enhancing technologies, (1-16)
  157. Forišek M Approximating rational numbers by fractions Proceedings of the 4th international conference on Fun with algorithms, (156-165)
  158. Avigad J and Donnelly K (2007). A Decision Procedure for Linear “Big O” Equations, Journal of Automated Reasoning, 38:4, (353-373), Online publication date: 1-May-2007.
  159. Tau C An XOR-based erasure-recovered algorithm for tolerating double disk failure in disk array systems Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology, (270-275)
  160. Duch A and Martínez C On the average cost of insertions on random relaxed K-d trees Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, (194-200)
  161. Gairing M, Lücking T, Mavronicolas M and Monien B (2006). The price of anarchy for polynomial social cost, Theoretical Computer Science, 369:1, (116-135), Online publication date: 15-Dec-2006.
  162. Maass M (2006). Average-Case Analysis of Approximate Trie Search, Algorithmica, 46:3-4, (469-491), Online publication date: 1-Nov-2006.
  163. Wernicke S (2006). Efficient Detection of Network Motifs, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3:4, (347-359), Online publication date: 1-Oct-2006.
  164. Furia C and Rossi M Integrating discrete- and continuous-time metric temporal logics through sampling Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems, (215-229)
  165. Leão R and Barbosa V Minimal chordal sense of direction and circulant graphs Proceedings of the 31st international conference on Mathematical Foundations of Computer Science, (670-680)
  166. Dantsin E and Wolpert A MAX-SAT for formulas with constant clause density can be solved faster than in O(2) time Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing, (266-276)
  167. ACM
    Henderson P (2006). The Josephus Flavius' problem, ACM SIGCSE Bulletin, 38:2, (17-20), Online publication date: 1-Jun-2006.
  168. ACM
    Ambainis A, Špalek R and de Wolf R A new quantum lower bound method, Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, (618-633)
  169. Masucci B (2006). Sharing Multiple Secrets, Designs, Codes and Cryptography, 39:1, (89-111), Online publication date: 1-Apr-2006.
  170. Castro-González N, Dopazo E and Robles J (2006). Formulas for the drazin inverse of special block matrices, Applied Mathematics and Computation, 174:1, (252-270), Online publication date: 1-Mar-2006.
  171. ACM
    Luca B, Andrei S, Anderson H and Khoo S Program transformation by solving recurrences Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (121-129)
  172. Tuyls P, Hollmann H, Lint J and Tolhuizen L (2005). XOR-based Visual Cryptography Schemes, Designs, Codes and Cryptography, 37:1, (169-186), Online publication date: 1-Oct-2005.
  173. Borel J and Reutenauer C Some new results on palindromic factors of billiard words Proceedings of the 9th international conference on Developments in Language Theory, (180-188)
  174. Bell P and Potapov I On the membership of invertible diagonal matrices Proceedings of the 9th international conference on Developments in Language Theory, (146-157)
  175. ACM
    Grabner P, Heuberger C, Prodinger H and Thuswaldner J (2005). Analysis of linear combination algorithms in cryptography, ACM Transactions on Algorithms, 1:1, (123-142), Online publication date: 1-Jul-2005.
  176. Flocchini P, Huang M and Luccio F Contiguous Search in the Hypercube for Capturing an Intruder Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
  177. Ferrara M, Kohayakawa Y and Rödl V (2005). Distance Graphs on the Integers, Combinatorics, Probability and Computing, 14:1, (107-131), Online publication date: 1-Jan-2005.
  178. Potapov I From post systems to the reachability problems for matrix semigroups and multicounter automata Proceedings of the 8th international conference on Developments in Language Theory, (345-356)
  179. Wang D, Liau C and Hsu T (2004). Medical privacy protection based on granular computing, Artificial Intelligence in Medicine, 32:2, (137-149), Online publication date: 1-Oct-2004.
  180. ACM
    Ostromoukhov V, Donohue C and Jodoin P Fast hierarchical importance sampling with blue noise properties ACM SIGGRAPH 2004 Papers, (488-495)
  181. ACM
    Ostromoukhov V, Donohue C and Jodoin P (2004). Fast hierarchical importance sampling with blue noise properties, ACM Transactions on Graphics, 23:3, (488-495), Online publication date: 1-Aug-2004.
  182. da Fonseca G, de Figueiredo C and Carvalho P (2004). Kinetic hanger, Information Processing Letters, 89:3, (151-157), Online publication date: 14-Feb-2004.
  183. Ahn H, Cheng S, Cheong O, Golin M and van Oostrum R (2004). Competitive facility location, Theoretical Computer Science, 310:1-3, (457-467), Online publication date: 1-Jan-2004.
  184. Gärtner B, Tschirschnitz F, Welzl E, Solymosi J and Valtr P (2003). One line and n points, Random Structures & Algorithms, 23:4, (453-471), Online publication date: 1-Dec-2003.
  185. Lloyd L and Skiena S Parsing Without a Grammar Proceedings of the Third IEEE International Conference on Data Mining
  186. Kubiak W (2003). Cyclic Just-In-Time Sequences Are Optimal, Journal of Global Optimization, 27:2-3, (333-347), Online publication date: 1-Nov-2003.
  187. Igel C and Toussaint M (2003). Neutrality and self-adaptation, Natural Computing: an international journal, 2:2, (117-132), Online publication date: 7-Jul-2003.
  188. ACM
    Itoh T, Takei Y and Tarui J On the sample size of k-restricted min-wise independent permutations and other k-wise distributions Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, (710-719)
  189. ACM
    Peraki C and Servetto S On the maximum stable throughput problem in random networks with directional antennas Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, (76-87)
  190. Grabmeier J, Kaltofen E and Weispfenning V Cited References Computer algebra handbook, (493-622)
  191. ACM
    Lee D, Mani M, Chiu F and Chu W NeT & CoT Proceedings of the eleventh international conference on Information and knowledge management, (282-291)
  192. Van Hulle M (2002). Kernel-based topographic map formation achieved with an information-theoretic approach, Neural Networks, 15:8-9, (1029-1039), Online publication date: 1-Oct-2002.
  193. Chrzastowski-Wachtel P and Tyszkiewicz J A maple package for conditional event algebras Proceedings of the 2002 international conference on Conditionals, Information, and Inference, (131-151)
  194. Fack V, Lievens S and Van der Jeugt J (2002). On the diameter of the rotation graph of binary coupling trees, Discrete Mathematics, 245:1, (1-18), Online publication date: 28-Feb-2002.
  195. ACM
    Le H (2001). Computing the minimal telescoper for sums of hypergeometric terms, ACM SIGSAM Bulletin, 35:3, (2-10), Online publication date: 1-Sep-2001.
  196. Oliveira G, de Oliveira P and Omar N (2001). Definition and application of a five-parameter characterization of one-dimensional cellular automata rule space, Artificial Life, 7:3, (277-301), Online publication date: 1-Jun-2001.
  197. Dieker S, Güting R and Luaces M A Tool for Nesting and Clustering Large Objects Proceedings of the 12th International Conference on Scientific and Statistical Database Management
  198. ACM
    Corless R, Giesbrecht M, Jeffrey D and Watt S Approximate polynomial decomposition Proceedings of the 1999 international symposium on Symbolic and algebraic computation, (213-219)
  199. Szegedy M In how many steps the k peg version of the towers of Hanoi game can be solved? Proceedings of the 16th annual conference on Theoretical aspects of computer science, (356-361)
  200. Stolzenburg F (1999). An Algorithm for General Set Unification and Its Complexity, Journal of Automated Reasoning, 22:1, (45-63), Online publication date: 1-Jan-1999.
  201. Yeh C and Varvarigos E (1998). Macro-Star Networks, IEEE Transactions on Parallel and Distributed Systems, 9:10, (987-1003), Online publication date: 1-Oct-1998.
  202. Fahringer T (1998). Efficient Symbolic Analysis for Parallelizing Compilers and Performance Estimators, The Journal of Supercomputing, 12:3, (227-252), Online publication date: 1-May-1998.
  203. Basye K, Dean T and Vitter J (1997). Coping with Uncertainty in Map Learning, Machine Language, 29:1, (65-88), Online publication date: 1-Oct-1997.
  204. ACM
    von zur Gathen J and Gerhard J Fast algorithms for Taylor shifts and certain difference equations Proceedings of the 1997 international symposium on Symbolic and algebraic computation, (40-47)
Contributors
  • University of California, San Diego
  • Stanford University
  • Center for Communication Research La Jolla

Recommendations