skip to main content
Skip header Section
The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision DiagramsMarch 2009
Publisher:
  • Addison-Wesley Professional
ISBN:978-0-321-58050-4
Published:27 March 2009
Pages:
272
Skip Bibliometrics Section
Bibliometrics
Skip Abstract Section
Abstract

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuths writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing programmers have successfully applied his cookbook solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete.Volume 4, Fascicle 1 This fascicle, enlivened by a wealth of Knuths typically enjoyable examples, describes basic broadword operations and an important class of data structures that can make computer programs run dozenseven thousandsof times faster. The author brings together and explains a substantial amount of previously scattered but eminently practical information known only to a few specialists. The book also includes nearly five-hundred exercises for self-study, with detailed answers given in nearly every case; dozens of these exercises present original material that has never before been published. Simply put, this fascicle is a must-have for anybody who is faced with tough problems of a combinatorial flavor. It demonstrates how ordinary programmers can make use of powerful techniques that heretofore seemed to be available only to people who used specialized languages and software. It shows how ideas once thought to be far out are now ready to become a part of the programming mainstream.

Cited By

  1. ACM
    Heß T, Schmidt T, Ostheimer L, Krieter S and Thüm T UnWise: High T-Wise Coverage from Uniform Sampling Proceedings of the 18th International Working Conference on Variability Modelling of Software-Intensive Systems, (37-45)
  2. ACM
    Kelly T (2024). Programmer Job Interviews: The Hidden Agenda, Queue, 21:6, (16-26), Online publication date: 31-Dec-2024.
  3. ACM
    Hance T, Howell J, Padon O and Parno B (2023). Leaf: Modularity for Temporary Sharing in Separation Logic, Proceedings of the ACM on Programming Languages, 7:OOPSLA2, (31-58), Online publication date: 16-Oct-2023.
  4. Katkovnik V, Shevkunov I and Egiazarian K (2023). ADMM and spectral proximity operators in hyperspectral broadband phase retrieval for quantitative phase imaging, Signal Processing, 210:C, Online publication date: 1-Sep-2023.
  5. Bird T, Pangborn H, Jain N and Koeln J (2023). Hybrid zonotopes, Automatica (Journal of IFAC), 154:C, Online publication date: 1-Aug-2023.
  6. ACM
    Watt S Efficient Generic Quotients Using Exact Arithmetic Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation, (535-544)
  7. ACM
    Li Y, Lu J and Chandramouli B (2023). Selection Pushdown in Column Stores using Bit Manipulation Instructions, Proceedings of the ACM on Management of Data, 1:2, (1-26), Online publication date: 13-Jun-2023.
  8. ACM
    Stoian M Fast Joint Shapley Values Companion of the 2023 International Conference on Management of Data, (285-287)
  9. ACM
    Merino A, Mütze T and Namrata Kneser Graphs Are Hamiltonian Proceedings of the 55th Annual ACM Symposium on Theory of Computing, (963-970)
  10. Li P, Lu H, Zhu R, Ding B, Yang L and Pan G (2023). DILI: A Distribution-Driven Learned Index, Proceedings of the VLDB Endowment, 16:9, (2212-2224), Online publication date: 1-May-2023.
  11. Abdulaziz M and Kurz F Formally verified SAT-based AI planning Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence, (14665-14673)
  12. ACM
    Antognazza F, Barenghi A, Pelosi G and Susella R A Flexible ASIC-Oriented Design for a Full NTRU Accelerator Proceedings of the 28th Asia and South Pacific Design Automation Conference, (591-597)
  13. ACM
    Lonati V, Brodnik A, Bell T, Csizmadia A, De Mol L, Hickman H, Keane T, Mirolo C and Monga M What We Talk About When We Talk About Programs Proceedings of the 2022 Working Group Reports on Innovation and Technology in Computer Science Education, (117-164)
  14. Zhang Z, Ng I, Gong D, Liu Y, Abbasnejad E, Gong M, Zhang K and Shi J Truncated matrix power iteration for differentiable DAG learning Proceedings of the 36th International Conference on Neural Information Processing Systems, (18390-18402)
  15. ACM
    Fernandez-Amoros D, Heradio R, Mayr-Dorn C and Egyed A Scalable Sampling of Highly-Configurable Systems: Generating Random Instances of the Linux Kernel Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering, (1-12)
  16. ACM
    Ngo T and Williams A Entropy Lost: Nintendo’s Not-So-Random Sequence of 32, 767 Bits Proceedings of the 17th International Conference on the Foundations of Digital Games, (1-10)
  17. ACM
    Karppa M and Pagh R HyperLogLogLog Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, (753-761)
  18. ACM
    Arroyuelo D, Navarro G, Reutter J and Rojas-Ledesma J (2022). Optimal Joins Using Compressed Quadtrees, ACM Transactions on Database Systems, 47:2, (1-53), Online publication date: 30-Jun-2022.
  19. ACM
    Yun J, Kim J, Hwang W, Kim Y, Woo S and Min B Residual size is not enough for anomaly detection Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing, (87-96)
  20. ACM
    Mahmud S, Haque S and Choudhury N Improving counting sort algorithm via data locality Proceedings of the 2022 ACM Southeast Conference, (211-214)
  21. ACM
    Bernardini G, Chen H, Fici G, Loukides G and Pissis S (2021). Reverse-Safe Text Indexing, ACM Journal of Experimental Algorithmics, 26, (1-26), Online publication date: 31-Dec-2022.
  22. Lázaro J, Bidarte U, Muguira L, Cuadrado C and Jiménez J (2021). Fast and efficient address search in System-on-a-Programmable-Chip using binary trees, Computers and Electrical Engineering, 96:PB, Online publication date: 1-Dec-2021.
  23. ACM
    Srivastava A, Chockalingam S, Aluru M and Aluru S Parallel construction of module networks Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (1-14)
  24. ACM
    Häcker C, Bouros P, Chondrogiannis T and Althaus E Most Diverse Near-Shortest Paths Proceedings of the 29th International Conference on Advances in Geographic Information Systems, (229-239)
  25. ACM
    Videla A (2021). Meaning and Context in Computer Programs, Queue, 19:5, (60-68), Online publication date: 31-Oct-2021.
  26. ACM
    Mukunoki D, Ozaki K, Ogita T and Imamura T Accurate Matrix Multiplication on Binary128 Format Accelerated by Ozaki Scheme 50th International Conference on Parallel Processing, (1-11)
  27. ACM
    Chan T and Williams R (2020). Deterministic APSP, Orthogonal Vectors, and More, ACM Transactions on Algorithms, 17:1, (1-14), Online publication date: 31-Jan-2021.
  28. ACM
    Walter M, Haaswijk W, Wille R, Torres F and Drechsler R One-pass Synthesis for Field-coupled Nanocomputing Technologies Proceedings of the 26th Asia and South Pacific Design Automation Conference, (574-580)
  29. ACM
    Barabasz B, Anderson A, Soodhalter K and Gregg D (2020). Error Analysis and Improving the Accuracy of Winograd Convolution for Deep Neural Networks, ACM Transactions on Mathematical Software, 46:4, (1-33), Online publication date: 31-Dec-2021.
  30. ACM
    Escamocher G, O'Sullivan B and Prestwich S (2020). Generating Difficult CNF Instances in Unexplored Constrainedness Regions, ACM Journal of Experimental Algorithmics, 25, (1-12), Online publication date: 6-Dec-2020.
  31. ACM
    Lange M and Rump S (2020). Faithfully Rounded Floating-point Computations, ACM Transactions on Mathematical Software, 46:3, (1-20), Online publication date: 30-Sep-2020.
  32. ACM
    Hillerström D, Lindley S and Longley J (2020). Effects for efficiency: asymptotic speedup with first-class control, Proceedings of the ACM on Programming Languages, 4:ICFP, (1-29), Online publication date: 2-Aug-2020.
  33. ACM
    Guo Q, Wang S, Wei Z and Chen M Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, (2167-2181)
  34. ACM
    Sawada J and Williams A (2019). Solving the Sigma-Tau Problem, ACM Transactions on Algorithms, 16:1, (1-17), Online publication date: 31-Jan-2020.
  35. Lin Z (2020). Patterns of relation triples in inversion and ascent sequences, Theoretical Computer Science, 804:C, (115-125), Online publication date: 12-Jan-2020.
  36. ACM
    Chatterjee K, Fu H and Goharshady A (2019). Non-polynomial Worst-Case Analysis of Recursive Programs, ACM Transactions on Programming Languages and Systems, 41:4, (1-52), Online publication date: 31-Dec-2020.
  37. Hassanien M, Loskot P, Al-Shehri S, Numanoǧlu T and Mert M (2019). Design and performance evaluation of bitwise retransmission schemes in wireless sensor networks, Physical Communication, 37:C, Online publication date: 1-Dec-2019.
  38. Toulabinejad M, Taheri M, Navi K and Bagherzadeh N (2019). Toward efficient implementation of basic balanced ternary arithmetic operations in CNFET technology, Microelectronics Journal, 90:C, (267-277), Online publication date: 1-Aug-2019.
  39. ACM
    Guo H, Jerrum M and Liu J (2019). Uniform Sampling Through the Lovász Local Lemma, Journal of the ACM, 66:3, (1-31), Online publication date: 30-Jun-2019.
  40. ACM
    Van Sandt P, Chronis Y and Patel J Efficiently Searching In-Memory Sorted Arrays Proceedings of the 2019 International Conference on Management of Data, (36-53)
  41. ACM
    Mutlu O, Ghose S, Gómez-Luna J and Ausavarungnirun R Enabling Practical Processing in and near Memory for Data-Intensive Computing Proceedings of the 56th Annual Design Automation Conference 2019, (1-4)
  42. ACM
    Moitra A (2019). Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models, Journal of the ACM, 66:2, (1-25), Online publication date: 26-Apr-2019.
  43. ACM
    Sanger R, Luckie M and Nelson R Identifying Equivalent SDN Forwarding Behaviour Proceedings of the 2019 ACM Symposium on SDN Research, (127-139)
  44. ACM
    Newton J and Verna D (2019). A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams, ACM Transactions on Computational Logic, 20:1, (1-36), Online publication date: 31-Jan-2019.
  45. Maehara T and Inoue Y Group decision diagram (GDD) Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, (2986-2994)
  46. Rosin C Stepping stones to inductive synthesis of low-level looping programs Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, (2362-2370)
  47. ACM
    Newton J and Verna D Recognizing heterogeneous sequences by rational type expression Proceedings of the 3rd ACM SIGPLAN International Workshop on Meta-Programming Techniques and Reflection, (5-14)
  48. Newton J and Verna D Strategies for Typecase Optimization Proceedings of the 11th European Lisp Symposium on European Lisp Symposium, (23-31)
  49. ACM
    Tarau P Declarative algorithms for generation, counting and random sampling of term algebras Proceedings of the 33rd Annual ACM Symposium on Applied Computing, (1203-1210)
  50. ACM
    Buchwald S, Fried A and Hack S Synthesizing an instruction selection rule library from semantic specifications Proceedings of the 2018 International Symposium on Code Generation and Optimization, (300-313)
  51. Choi A, Shen Y and Darwiche A Tractability in structured probability spaces Proceedings of the 31st International Conference on Neural Information Processing Systems, (3480-3488)
  52. Yu Y, Zhao Y, Yu G and Wang G (2017). Mining coterie patterns from Instagram photo trajectories for recommending popular travel routes, Frontiers of Computer Science: Selected Publications from Chinese Universities, 11:6, (1007-1022), Online publication date: 1-Dec-2017.
  53. ACM
    Seshadri V, Lee D, Mullins T, Hassan H, Boroumand A, Kim J, Kozuch M, Mutlu O, Gibbons P and Mowry T Ambit Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture, (273-287)
  54. ACM
    Goodwin B, Hopcroft M, Luu D, Clemmer A, Curmei M, Elnikety S and He Y BitFunnel Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, (605-614)
  55. Li Y, Katsipoulakis N, Chandramouli B, Goldstein J and Kossmann D (2017). Mison, Proceedings of the VLDB Endowment, 10:10, (1118-1129), Online publication date: 1-Jun-2017.
  56. Maehara T, Suzuki H and Ishihata M Exact Computation of Influence Spread by Binary Decision Diagrams Proceedings of the 26th International Conference on World Wide Web, (947-956)
  57. Wang Q and Tan C (2016). On the second-order nonlinearity of the hidden weighted bit function, Discrete Applied Mathematics, 215:C, (197-202), Online publication date: 31-Dec-2016.
  58. Denzumi S, Yoshinaka R, Arimura H and Minato S (2016). Sequence binary decision diagram, Discrete Applied Mathematics, 212:C, (61-80), Online publication date: 30-Oct-2016.
  59. ACM
    Bernasconi A and Ciriani V (2016). Index-Resilient Zero-Suppressed BDDs, ACM Transactions on Design Automation of Electronic Systems, 21:4, (1-27), Online publication date: 22-Sep-2016.
  60. Choi A, Tavabi N and Darwiche A Structured features in naive Bayes classification Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, (3233-3240)
  61. ACM
    Grossi R and Ottaviano G (2015). Fast Compressed Tries through Path Decompositions, ACM Journal of Experimental Algorithmics, 19, (1.1-1.20), Online publication date: 3-Feb-2015.
  62. ACM
    Tarau P Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, (31-42)
  63. Wei H, Yu J, Lu C and Jin R (2014). Reachability querying, Proceedings of the VLDB Endowment, 7:12, (1191-1202), Online publication date: 1-Aug-2014.
  64. Ewald R Using AI planning to automate the performance analysis of simulators Proceedings of the 7th International ICST Conference on Simulation Tools and Techniques, (195-200)
  65. Cantone D and Hofri M (2013). Further analysis of the remedian algorithm, Theoretical Computer Science, 495, (1-16), Online publication date: 1-Jul-2013.
  66. ACM
    Weichselbraun A, Scharl A and Lang H Knowledge capture from multiple online sources with the extensible web retrieval toolkit (eWRT) Proceedings of the seventh international conference on Knowledge capture, (129-132)
  67. ACM
    Vasilikos V, Smaragdos G, Strydis C and Sourdis I (2013). Heuristic search for adaptive, defect-tolerant multiprocessor arrays, ACM Transactions on Embedded Computing Systems, 12:1s, (1-23), Online publication date: 1-Mar-2013.
  68. ACM
    Tarau P and Luderman B Symbolic modeling of a universal reconfigurable logic gate and its applications to circuit synthesis Proceedings of the 2012 ACM Research in Applied Computation Symposium, (389-394)
  69. Edelkamp S, Elmasry A and Katajainen J (2012). The weak-heap data structure, Journal of Discrete Algorithms, 16, (187-205), Online publication date: 1-Oct-2012.
  70. Yamanaka K, Otachi Y and Nakano S (2012). Efficient enumeration of ordered trees with k leaves, Theoretical Computer Science, 442, (22-27), Online publication date: 1-Jul-2012.
  71. Kaneta Y, Arimura H and Raman R (2012). Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism, Journal of Discrete Algorithms, 14, (119-135), Online publication date: 1-Jul-2012.
  72. Kiyomi M, Okamoto Y and Saitoh T Efficient enumeration of the directed binary perfect phylogenies from incomplete data Proceedings of the 11th international conference on Experimental Algorithms, (248-259)
  73. Shirai Y, Tsuruma K, Sakurai Y, Oyama S and Minato S Incremental set recommendation based on class differences Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I, (183-194)
  74. Tarau P A declarative specification of tree-based symbolic arithmetic computations Proceedings of the 14th international conference on Practical Aspects of Declarative Languages, (273-288)
  75. ACM
    Pedemonte M, Alba E and Luna F Bitwise operations for GPU implementation of genetic algorithms Proceedings of the 13th annual conference companion on Genetic and evolutionary computation, (439-446)
  76. Ciriani V, De Capitani Di Vimercati S, Foresti S, Livraga G and Samarati P Enforcing confidentiality and data visibility constraints Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy, (44-59)
  77. Minato S πDD Proceedings of the 14th international conference on Theory and application of satisfiability testing, (90-104)
  78. Grossi R (2011). A quick tour on suffix arrays and compressed suffix arrays, Theoretical Computer Science, 412:27, (2964-2973), Online publication date: 1-Jun-2011.
  79. Labarre A and Cibulka J (2011). Polynomial-time sortable stacks of burnt pancakes, Theoretical Computer Science, 412:8-10, (695-702), Online publication date: 1-Mar-2011.
  80. Kaporis A, Makris C, Mavritsakis G, Sioutas S, Tsakalidis A, Tsichlas K and Zaroliagis C (2010). ISB-tree, Journal of Discrete Algorithms, 8:4, (373-387), Online publication date: 1-Dec-2010.
  81. Horiyama T and Yamane S Generation of polyiamonds for p6 tiling by the reverse search Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications, (96-107)
  82. Erickson A, Ruskey F, Schurch M and Woodcock J Auspicious Tatami mat arrangements Proceedings of the 16th annual international conference on Computing and combinatorics, (288-297)
  83. Busch C and Mavronicolas M (2010). An efficient counting network, Theoretical Computer Science, 411:34-36, (3001-3030), Online publication date: 1-Jul-2010.
  84. Glaíer C, Reitwieíner C, Travers S and Waldherr M (2010). Satisfiability of algebraic circuits over sets of natural numbers, Discrete Applied Mathematics, 158:13, (1394-1403), Online publication date: 1-Jul-2010.
  85. Foata D and Han G (2009). New permutation coding and equidistribution of set-valued statistics, Theoretical Computer Science, 410:38-40, (3743-3750), Online publication date: 1-Sep-2009.
  86. Hurlbert G, Johnson T and Zahl J (2009). On universal cycles for multisets, Discrete Mathematics, 309:17, (5321-5327), Online publication date: 1-Sep-2009.
  87. Konstantinova E (2009). Vertex reconstruction in Cayley graphs, Discrete Mathematics, 309:3, (548-559), Online publication date: 1-Feb-2009.
  88. Zou L, Chen X and Zhang W (2008). Local bifurcations of critical periods for cubic Liénard equations with cubic damping, Journal of Computational and Applied Mathematics, 222:2, (404-410), Online publication date: 20-Dec-2008.
  89. Graillat S (2008). Accurate simple zeros of polynomials in floating point arithmetic, Computers & Mathematics with Applications, 56:4, (1114-1120), Online publication date: 1-Aug-2008.
  90. ACM
    Spector L, Clark D, Lindsay I, Barr B and Klein J Genetic programming for finite algebras Proceedings of the 10th annual conference on Genetic and evolutionary computation, (1291-1298)
  91. Branford S, Sahin C, Thandavan A, Weihrauch C, Alexandrov V and Dimov I (2008). Monte Carlo methods for matrix computations on the grid, Future Generation Computer Systems, 24:6, (605-612), Online publication date: 1-Jun-2008.
  92. Tsigaridas E and Emiris I (2008). On the complexity of real root isolation using continued fractions, Theoretical Computer Science, 392:1-3, (158-173), Online publication date: 20-Feb-2008.
  93. Tabrizi N and Bagherzadeh N (2008). An ASIC design and formal analysis of a novel pipelined and parallel sorting accelerator, Integration, the VLSI Journal, 41:1, (65-75), Online publication date: 1-Jan-2008.
  94. Gál A and Miltersen P (2007). The cell probe complexity of succinct data structures, Theoretical Computer Science, 379:3, (405-417), Online publication date: 10-Jul-2007.
  95. Papakostas G, Boutalis Y, Karras D and Mertzios B (2007). A new class of Zernike moments for computer vision applications, Information Sciences: an International Journal, 177:13, (2802-2819), Online publication date: 1-Jul-2007.
  96. Manthey B and Reischuk R (2007). Smoothed analysis of binary search trees, Theoretical Computer Science, 378:3, (292-315), Online publication date: 20-Jun-2007.
  97. Chen E, Yang L and Yuan H (2007). Longest increasing subsequences in windows based on canonical antichain partition, Theoretical Computer Science, 378:3, (223-236), Online publication date: 20-Jun-2007.
  98. Peinecke N, Wolter F and Reuter M (2007). Laplace spectra as fingerprints for image recognition, Computer-Aided Design, 39:6, (460-476), Online publication date: 1-Jun-2007.
  99. Chang G, Eu S and Yeh C (2007). On the (n,t)-antipodal Gray codes, Theoretical Computer Science, 374:1-3, (82-90), Online publication date: 1-Apr-2007.
  100. Lahiri S and Musuvathi M (2006). An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals, Electronic Notes in Theoretical Computer Science (ENTCS), 144:2, (27-41), Online publication date: 1-Jan-2006.
  101. Kowalski D and Shvartsman A (2005). Performing work with asynchronous processors, Information and Computation, 203:2, (181-210), Online publication date: 15-Dec-2005.
  102. Campos A and Navarro J (2004). A page-coherent, causally consistent protocol for distributed shared memory, Journal of Systems and Software, 72:3, (305-319), Online publication date: 1-Aug-2004.
  103. Chang J, Chen R and Hwang F (2001). A Minimal-Automaton-Based Algorithm for the Reliability of Con(d, k, n) Systems, Methodology and Computing in Applied Probability, 3:4, (379-386), Online publication date: 1-Dec-2001.
  104. Mäkinen E (1999). Generating random binary trees - A survey, Information Sciences: an International Journal, 115:1-4, (123-136), Online publication date: 1-Apr-1999.
  105. Mahjoub Z and Karoui-Sahtout F (1991). Paper, Parallel Computing, 17:4-5, (471-481), Online publication date: 1-Jul-1991.
  106. Culik K and Yu S (1988). The emptiness problem for CA limit sets, Mathematical and Computer Modelling: An International Journal, 11, (363-366), Online publication date: 31-Dec-1988.
  107. Glynn P (1987). Upper bounds on Poisson tail probabilities, Operations Research Letters, 6:1, (9-14), Online publication date: 1-Mar-1987.
  108. Chudnovsky D and Chudnovsky G (1986). Sequences of numbers generated by addition in formal groups and new primality and factorization tests, Advances in Applied Mathematics, 7:4, (385-434), Online publication date: 1-Dec-1986.
  109. Heath D and Sanchez P (1986). On the adequacy of pseudo-random number generators (or, Operations Research Letters, 5:1, (3-6), Online publication date: 1-Jun-1986.
  110. Becker R and Perl Y (1985). Finding the two-core of a tree, Discrete Applied Mathematics, 11:2, (103-113), Online publication date: 1-Jun-1985.
  111. Flowers P and Kandel A (1985). Possibilistic search trees, Fuzzy Sets and Systems, 16:1, (1-24), Online publication date: 1-May-1985.
  112. Frederickson P, Hiromoto R, Jordan T, Smith B and Warnock T (1984). Pseudo-random trees in Monte Carlo, Parallel Computing, 1:2, (175-180), Online publication date: 1-Dec-1984.
  113. Broder A (1984). The r-Stirling numbers, Discrete Mathematics, 49:3, (241-259), Online publication date: 1-May-1984.
  114. Brennan J (1982). Minimal spanning trees and partial sorting, Operations Research Letters, 1:3, (113-116), Online publication date: 1-Jul-1982.
  115. Françon J and Viennot G (1979). Permutations selon leurs pics, creux, doubles montées et double descentes, nombres d'euler et nombres de Genocchi, Discrete Mathematics, 28:1, (21-35), Online publication date: 1-Jan-1979.
  116. Fredman M (1975). On computing the length of longest increasing subsequences, Discrete Mathematics, 11:1, (29-35), Online publication date: 1-Jan-1975.
Contributors
  • Stanford University

Recommendations