Browse Books

Mukunoki D, Ozaki K, Ogita T and Imamura T Infinite-Precision Inner Product and Sparse Matrix-Vector Multiplication Using Ozaki Scheme with Dot2 on Manycore Processors Parallel Processing and Applied Mathematics, (40-54)

Bernstein A and Chechik S Incremental topological sort and cycle detection in [Equation] expected total time Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (21-34)

Lohrey M, Maneth S and Reh C (2018). Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees, Algorithmica, 80:7, (2082-2105), Online publication date: 1-Jul-2018.

Decarlo E, Mahadevan S and Smarslok B (2018). Efficient global sensitivity analysis with correlated variables, Structural and Multidisciplinary Optimization, 58:6, (2325-2340), Online publication date: 1-Dec-2018.

Navarro G and Nekrich Y (2017). Time-Optimal Top-$k$ Document Retrieval, SIAM Journal on Computing, 46:1, (80-113), Online publication date: 8-Feb-2017.

(2018). A new neural unsupervised classification approach using amended competitive Hebbian learning, International Journal of Bioinformatics Research and Applications, 13:1, (1-21), Online publication date: 1-Jan-2017.

Klein S and Shapira D (2016). Random access to Fibonacci encoded files, Discrete Applied Mathematics, 212:C, (115-128), Online publication date: 30-Oct-2016.

Konyagin S, Luca F, Mans B, Mathieson L, Sha M and Shparlinski I (2018). Functional graphs of polynomials over finite fields, Journal of Combinatorial Theory Series B, 116:C, (87-122), Online publication date: 1-Jan-2016.

Serre F, Holenstein T and Püschel M Optimal Circuits for Streamed Linear Permutations Using RAM Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, (215-223)

Prodinger H (2016). Batcher's odd-even exchange revisited, Theoretical Computer Science, 636:C, (95-100), Online publication date: 11-Jul-2016.

Martínez-Prieto M, Brisaboa N, Cánovas R, Claude F and Navarro G (2016). Practical compressed string dictionaries, Information Systems, 56:C, (73-108), Online publication date: 1-Mar-2016.

Kim J, Mészáros K, Panova G and Wilson D (2014). Dyck tilings, increasing trees, descents, and inversions, Journal of Combinatorial Theory Series A, 122:C, (9-27), Online publication date: 1-Feb-2014.

Piñero F and Janwa H (2018). On the subfield subcodes of Hermitian codes, Designs, Codes and Cryptography, 70:1-2, (157-173), Online publication date: 1-Jan-2014.

Kim H, Cho K, Kim S and Kim J Optimal RGB Light-Mixing for Image Acquisition Using Random Search and Robust Parameter Design Proceedings of the 16th International Workshop on Combinatorial Image Analysis - Volume 8466, (171-185)

Crochemore M, Iliopoulos C, Kociumaka T, Kubica M, Langiu A, Pissis S, Radoszewski J, Rytter W and Waleń T Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes Proceedings of the 20th International Symposium on String Processing and Information Retrieval - Volume 8214, (84-95)

Myreen M and Curello G Proof Pearl Proceedings of the Third International Conference on Certified Programs and Proofs - Volume 8307, (66-81)

Vanka R and Tuck J Efficient and accurate data dependence profiling using software signatures Proceedings of the Tenth International Symposium on Code Generation and Optimization, (186-195)

Martínez-Prieto M, Fernández J and Cánovas R Compression of RDF dictionaries Proceedings of the 27th Annual ACM Symposium on Applied Computing, (340-347)

Zuluaga M, Milder P and Püschel M Computer generation of streaming sorting networks Proceedings of the 49th Annual Design Automation Conference, (1245-1253)

Martínez-Prieto M, Fernández J and Cánovas R (2012). Querying RDF dictionaries in compressed space, ACM SIGAPP Applied Computing Review, 12:2, (64-77), Online publication date: 1-Jun-2012.

Inoue H, Moriyama T, Komatsu H and Nakatani T (2019). A high-performance sorting algorithm for multicore single-instruction multiple-data processors, Software—Practice & Experience, 42:6, (753-777), Online publication date: 1-Jun-2012.

Dinur I, Dunkelman O, Keller N and Shamir A Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems Proceedings of the 32nd Annual Cryptology Conference on Advances in Cryptology --- CRYPTO 2012 - Volume 7417, (719-740)

Bhuiyan A, Lamoureux E, Nath B, Ramamohanarao K and Wong T (2011). Retinal image matching using hierarchical vascular features, Computational Intelligence and Neuroscience, 2011, (9-9), Online publication date: 1-Jan-2011.

Huang J, Liao I and Tang H (2011). A forward authentication key management scheme for heterogeneous sensor networks, EURASIP Journal on Wireless Communications and Networking, 2011, (1-10), Online publication date: 1-Jan-2011.

Barzilay O Example embedding Proceedings of the 10th SIGPLAN symposium on New ideas, new paradigms, and reflections on programming and software, (137-144)

Ahmad M, Rahman N and Gruner S A phonetic approach to handling spelling variations in medieval documents Proceedings of the South African Institute of Computer Scientists and Information Technologists Conference on Knowledge, Innovation and Leadership in a Diverse, Multidisciplinary Environment, (263-266)

Coppersmith D, Nowicki T, Paleologo G, Tresser C and Wu C (2011). The optimality of the online greedy algorithm in carpool and chairman assignment problems, ACM Transactions on Algorithms, 7:3, (1-22), Online publication date: 1-Jul-2011.

Joannou S and Raman R An empirical evaluation of extendible arrays Proceedings of the 10th international conference on Experimental algorithms, (447-458)

Burch M, Schmauder H and Weiskopf D Indented pixel tree browser for exploring huge hierarchies Proceedings of the 7th international conference on Advances in visual computing - Volume Part I, (301-312)

Mu S and Oliveira J Programming from galois connections Proceedings of the 12th international conference on Relational and algebraic methods in computer science, (294-313)

Bender M, Hu H and Kuszmaul B Performance guarantees for B-trees with different-sized atomic keys Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (305-316)

Pikhurko O (2018). Finding an unknown acyclic orientation of a given graph, Combinatorics, Probability and Computing, 19:1, (121-131), Online publication date: 1-Jan-2010.

Jacobs T, Cicalese F, Laber E and Molinaro M On the complexity of searching in trees Proceedings of the 37th international colloquium conference on Automata, languages and programming, (527-539)

Zage D and Nita-Rotaru C (2010). Robust Decentralized Virtual Coordinate Systems in Adversarial Environments, ACM Transactions on Information and System Security, 13:4, (1-34), Online publication date: 1-Dec-2010.

Asuncion A and Goodrich M Turning privacy leaks into floods Proceedings of the 9th annual ACM workshop on Privacy in the electronic society, (21-30)

Rigo M Numeration systems Proceedings of the 14th international conference on Developments in language theory, (33-53)

Jaffari J and Anis M (2010). Advanced variance reduction and sampling techniques for efficient statistical timing analysis, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 29:12, (1894-1907), Online publication date: 1-Dec-2010.

Raidl G and Hu B Enhancing genetic algorithms by a trie-based complete solution archive Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization, (239-251)

Habernal I and Konopík M Hybrid semantic analysis system - ATIS data evaluation Proceedings of the 6th international conference on Advanced data mining and applications - Volume Part II, (376-386)

Estivill-Castro V Sorting and order statistics Algorithms and theory of computation handbook, (3-3)

Anton K and Thiemann P Typing coroutines Proceedings of the 11th international conference on Trends in functional programming, (16-30)

Edelkamp S and Sulewski D External memory breadth-first search with delayed duplicate detection on the GPU Proceedings of the 6th international conference on Model checking and artificial intelligence, (12-31)

Belazzougui D, Boldi P and Vigna S Dynamic z-fast tries Proceedings of the 17th international conference on String processing and information retrieval, (159-172)

Liu F, Ting K and Zhou Z On detecting clustered anomalies using SCiForest Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II, (274-290)

Tiakas E, Papadopoulos A and Manolopoulos Y Estimation of the maximum domination value in multi-dimensional data sets Proceedings of the 14th east European conference on Advances in databases and information systems, (505-519)

Yampolskiy R (2010). Application of bio-inspired algorithm to the problem of integer factorisation, International Journal of Bio-Inspired Computation, 2:2, (115-123), Online publication date: 1-Mar-2010.

Do J and Patel J Join processing for flash SSDs Proceedings of the Fifth International Workshop on Data Management on New Hardware, (1-8)

Stehouwer H and van Zaanen M Language models for contextual error detection and correction Proceedings of the EACL 2009 Workshop on Computational Linguistic Aspects of Grammatical Inference, (41-48)

Case J and Moelius S Independence results for n-ary recursion theorems Proceedings of the 17th international conference on Fundamentals of computation theory, (38-49)

Joye M and Tunstall M Exponent Recoding and Regular Exponentiation Algorithms Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology, (334-349)

Tunstall M Random Order m-ary Exponentiation Proceedings of the 14th Australasian Conference on Information Security and Privacy, (437-451)

Dries L and Moschovakis Y (2009). Arithmetic complexity, ACM Transactions on Computational Logic, 10:1, (1-49), Online publication date: 1-Jan-2009.

Konopík M and Habernal I Hybrid Semantic Analysis Proceedings of the 12th International Conference on Text, Speech and Dialogue, (307-314)

Abadi M, Mehrdad V and Husøy J Combining selective partial update and selective regressor approaches for affine projection adaptive filtering Proceedings of the 7th international conference on Information, communications and signal processing, (1277-1280)

Kujala J (2009). Assembling approximately optimal binary search trees efficiently using arithmetics, Information Processing Letters, 109:16, (962-966), Online publication date: 1-Jul-2009.

Guillemot S and Vialette S Pattern Matching for 321-Avoiding Permutations Proceedings of the 20th International Symposium on Algorithms and Computation, (1064-1073)

Jun H, Liu Z, Reed G and Sanders J Ensemble Engineering and Emergence Software-Intensive Systems and New Computing Paradigms, (162-178)

Menard D, Serizel R, Rocher R and Sentieys O (2008). Accuracy constraint determination in fixed-point system design, EURASIP Journal on Embedded Systems, 2008, (1-12), Online publication date: 1-Jan-2008.

He B and Luo Q (2008). Cache-oblivious databases, ACM Transactions on Database Systems, 33:2, (1-42), Online publication date: 1-Jun-2008.

Walters A, Zage D and Rotaru C (2008). A framework for mitigating attacks against measurement-based adaptation mechanisms in unstructured multicast overlay networks, IEEE/ACM Transactions on Networking (TON), 16:6, (1434-1446), Online publication date: 1-Dec-2008.

van den Bosch A and Bogers T Efficient context-sensitive word completion for mobile devices Proceedings of the 10th international conference on Human computer interaction with mobile devices and services, (465-470)

Qi X, Wu J, Li S and Li G (2008). Sorting by transpositions: dealing with length-weighted models, International Journal of Bioinformatics Research and Applications, 4:2, (164-171), Online publication date: 1-May-2008.

Dachsel H, Hofmann M and Rünger G Library support for parallel sorting in scientific computations Proceedings of the 13th international Euro-Par conference on Parallel Processing, (695-704)

Jermaine C, Omiecinski E and Yee W (2018). The partitioned exponential file for database storage management, The VLDB Journal — The International Journal on Very Large Data Bases, 16:4, (417-437), Online publication date: 1-Oct-2007.

Kim J and Kim S (2007). A Fast Computational Optimization Method, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E90-A:8, (1679-1689), Online publication date: 1-Aug-2007.

Helmer S, Aly R, Neumann T and Moerkotte G Indexing set-valued attributes with a multi-level extendible hashing scheme Proceedings of the 18th international conference on Database and Expert Systems Applications, (98-108)

Naeimi H and DeHon A Fault tolerant nano-memory with fault secure encoder and decoder Proceedings of the 2nd international conference on Nano-Networks, (1-7)

Zage D and Nita-Rotaru C On the accuracy of decentralized virtual coordinate systems in adversarial networks Proceedings of the 14th ACM conference on Computer and communications security, (214-224)

Fan J, Gao Y and Luo H Hierarchical classification for automatic image annotation Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, (111-118)

Hosangadi A, Fallah F and Kastner R (2018). Algebraic Methods for Optimizing Constant Multiplications in Linear Systems, Journal of VLSI Signal Processing Systems, 49:1, (31-50), Online publication date: 1-Oct-2007.

Kirkham C (2019). Ranked reservoir sampling: an extension to the reservoir sampling algorithm, Software—Practice & Experience, 37:12, (1285-1288), Online publication date: 1-Oct-2007.

Dietzfelbinger M Design strategies for minimal perfect hash functions Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications, (2-17)

Kim P and Kutzner A A Simple Algorithm for Stable Minimum Storage Merging Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science, (347-356)

Chan C, Yu H, Hon W and Wang B A faster query algorithm for the text fingerprinting problem Proceedings of the 15th annual European conference on Algorithms, (123-135)

Pelsmajer M, Schaefer M and Štefankovič D Crossing number of graphs with rotation systems Proceedings of the 15th international conference on Graph drawing, (3-12)

Niculescu V Data-distributions in powerlist theory Proceedings of the 4th international conference on Theoretical aspects of computing, (396-409)

Patwardhan J, Dwyer C and Lebeck A (2007). A self-organizing defect tolerant SIMD architecture, ACM Journal on Emerging Technologies in Computing Systems, 3:2, (10-es), Online publication date: 1-Jul-2007.

Hsu C, Chen C, Shih T and Chen C (2007). Measuring similarity between transliterations against noise data, ACM Transactions on Asian Language Information Processing, 6:1, (5-es), Online publication date: 1-Apr-2007.

Kik M Sorting long sequences in a single hop radio network Proceedings of the 31st international conference on Mathematical Foundations of Computer Science, (573-583)

Bogolubsky A and Skorokhodov S (2018). Fast evaluation of the hypergeometric function pFp-1(a; b; z) at the singular point z = 1 by means of the Hurwitz zeta function ζ(α, s), Programming and Computing Software, 32:3, (145-153), Online publication date: 1-May-2006.

Lee M, Whang K, Han W and Song I (2006). Transform-Space View, IEEE Transactions on Knowledge and Data Engineering, 18:2, (245-260), Online publication date: 1-Feb-2006.

Raman V and Swart G How to wring a table dry Proceedings of the 32nd international conference on Very large data bases, (858-869)

Baccelli F and McDonald D A stochastic model for the throughput of non-persistent TCP flows Proceedings of the 1st international conference on Performance evaluation methodolgies and tools, (58-es)

Stockinger K, Bethel E, Campbell S, Dart E and Wu K Detecting distributed scans using high-performance query-driven visualization Proceedings of the 2006 ACM/IEEE conference on Supercomputing, (82-es)

Patwardhan J, Johri V, Dwyer C and Lebeck A (2006). A defect tolerant self-organizing nanoscale SIMD architecture, ACM SIGARCH Computer Architecture News, 34:5, (241-251), Online publication date: 20-Oct-2006.

Patwardhan J, Johri V, Dwyer C and Lebeck A (2006). A defect tolerant self-organizing nanoscale SIMD architecture, ACM SIGPLAN Notices, 41:11, (241-251), Online publication date: 1-Nov-2006.

Patwardhan J, Johri V, Dwyer C and Lebeck A (2006). A defect tolerant self-organizing nanoscale SIMD architecture, ACM SIGOPS Operating Systems Review, 40:5, (241-251), Online publication date: 20-Oct-2006.

Patwardhan J, Johri V, Dwyer C and Lebeck A A defect tolerant self-organizing nanoscale SIMD architecture Proceedings of the 12th international conference on Architectural support for programming languages and operating systems, (241-251)

Zhang D and Lee W Extracting key-substring-group features for text classification Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, (474-483)

Sklavos N, Kitsos P, Papadopoulos K and Koufopavlou O (2018). Design, Architecture and Performance Evaluation of the Wireless Transport Layer Security, The Journal of Supercomputing, 36:1, (33-50), Online publication date: 1-Apr-2006.

Kendon V and Munro W (2006). Entanglement and its role in Shor's algorithm, Quantum Information & Computation, 6:7, (630-640), Online publication date: 1-Nov-2006.

Lee Y and Zhao W Domain requirements elicitation and analysis - an ontology-based approach Proceedings of the 6th international conference on Computational Science - Volume Part IV, (805-813)

Can F Turkish information retrieval Proceedings of the 4th international conference on Advances in Information Systems, (13-22)

Rosenberg A State Theoretical Computer Science, (375-398)

Coja-Oghlan A, Krumke S and Nierhoff T (2006). A heuristic for the Stacker Crane Problem on trees which is almost surely exact, Journal of Algorithms, 61:1, (1-19), Online publication date: 1-Sep-2006.

Hitczenko P and Knopfmacher A (2019). Gap-free compositions and gap-free samples of geometric random variables, Discrete Mathematics, 294:3, (225-239), Online publication date: 1-May-2005.

Ristov S (2019). LZ trie and dictionary compression, Software—Practice & Experience, 35:5, (445-465), Online publication date: 25-Apr-2005.

Champarnaud J and Paranthoën T (2005). Random generation of DFAs, Theoretical Computer Science, 330:2, (221-235), Online publication date: 2-Feb-2005.

Ryabenko A and Skorokhodov S (2018). Asymptotics of sums of hypergeometric terms, Programming and Computing Software, 31:2, (65-72), Online publication date: 1-Mar-2005.

Cooper P Speciation in the computing sciences Proceedings of the 2nd annual conference on Information security curriculum development, (19-23)

Filman R (2005). Postmodern Software Development, IEEE Internet Computing, 9:1, (4-6), Online publication date: 1-Jan-2005.

Bernstein D (2005). Factoring into coprimes in essentially linear time, Journal of Algorithms, 54:1, (1-30), Online publication date: 1-Jan-2005.

Hivert F, Novelli J and Thibon J (2019). The algebra of binary search trees, Theoretical Computer Science, 339:1, (129-165), Online publication date: 11-Jun-2005.

Liu J, Knowles C and Davis A A cost optimal parallel quicksorting and its implementation on a shared memory parallel computer Proceedings of the Third international conference on Parallel and Distributed Processing and Applications, (491-502)

Franceschini G Sorting stably, in-place, with O(n log n) comparisons and O(n) moves Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science, (629-640)

Bagchi A, Buchsbaum A and Goodrich M (2018). Biased Skip Lists, Algorithmica, 42:1, (31-48), Online publication date: 1-May-2005.

Chollet G, McTait K and Petrovska-Delacrétaz D Data driven approaches to speech and language processing Nonlinear Speech Modeling and Applications, (164-198)

Yavuz S A neural network based methodology for performance evaluation of parallel systems Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence, (297-307)

Langou J, Bosilca G, Fagg G and Dongarra J Hash functions for datatype signatures in MPI Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface, (76-83)

Moschovakis Y Recursion and complexity Proceedings of the First international conference on Computability in Europe: new Computational Paradigms, (350-357)

Gerbessiotis A and Siniolakis C (2019). Probabilistic integer sorting, Information Processing Letters, 90:4, (187-193), Online publication date: 31-May-2004.

Biedl T, Brejová B, Demaine E, Hamel A, López-Ortiz A and Vinař T (2004). Finding hidden independent sets in interval graphs, Theoretical Computer Science, 310:1-3, (287-307), Online publication date: 1-Jan-2004.

Valente P Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, (269-280)

Valente P (2019). Exact GPS simulation with logarithmic complexity, and its application to an optimally fair scheduler, ACM SIGCOMM Computer Communication Review, 34:4, (269-280), Online publication date: 30-Aug-2004.

Hore B, Hacigumus H, Iyer B and Mehrotra S Indexing text data under space constraints Proceedings of the thirteenth ACM international conference on Information and knowledge management, (198-207)

Ginat D (2019). Do senior CS students capitalize on recursion?, ACM SIGCSE Bulletin, 36:3, (82-86), Online publication date: 1-Sep-2004.

Ginat D Do senior CS students capitalize on recursion? Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education, (82-86)

Norman A, Ahmed A, Chou J, Dalal A, Fortson K, Jindal M, Kurz C, Lee H, Payne K, Rando R, Sheppard K, Sublett E, Sussman J and White I (2019). On the Computational Complexity of Consumer Decision Rules, Computational Economics, 23:2, (173-192), Online publication date: 1-Mar-2004.

Devroye L and Zamora-Cura C (2019). Expected worst-case partial match in random quadtries, Discrete Applied Mathematics, 141:1-3, (103-117), Online publication date: 30-May-2004.

Jigang W and Srikanthan T (2019). An efficient data structure for branch-and-bound algorithm, Information Sciences: an International Journal, 167:1-4, (233-237), Online publication date: 2-Dec-2004.

Kitaev S, Mansour T and Séébold P (2004). Generating the Peano curve and counting occurrences of some patterns, Journal of Automata, Languages and Combinatorics, 9:4, (439-455), Online publication date: 1-Oct-2004.

Hunziker M, Machiavelo A and Park J (2004). Chebyshev polynomials over finite fields and reversibility of σ-automata on square grids, Theoretical Computer Science, 320:2-3, (465-483), Online publication date: 14-Jun-2004.

Devroye L and Neininger R (2018). Random suffix search trees, Random Structures & Algorithms, 23:4, (357-396), Online publication date: 1-Dec-2003.

Abdullahi S, Dyer M and Proll L Listing vertices of simple polyhedra associated with dual LI (2) systems Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science, (89-96)

Devroye L and Morin P (2019). Cuckoo hashing, Information Processing Letters, 86:4, (215-219), Online publication date: 31-May-2003.

Bishnu A, Das S, Nandy S and Bhattacharya B An improved algorithm for point set pattern matching under rigid motion Proceedings of the 5th Italian conference on Algorithms and complexity, (36-45)

Palem K Energy aware algorithm design via probabilistic computing Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems, (113-116)

Annibali A and Bellini F Multidimensional corporate analysis Proceedings of the 2003 conference on APL: stretching the mind, (11-15)

Bucci M, Germani L, Luzzi R, Trifiletti A and Varanonuovo M (2003). A High-Speed Oscillator-Based Truly Random Number Source for Cryptographic Applications on a Smart Card IC, IEEE Transactions on Computers, 52:4, (403-409), Online publication date: 1-Apr-2003.

Noble J (2018). Recurses!, Computing in Science and Engineering, 5:3, (76-81), Online publication date: 1-May-2003.

Fort A, Cortigiani F, Rocchi S and Vignoli V (2019). Very High-Speed True Random Noise Generator, Analog Integrated Circuits and Signal Processing, 34:2, (97-105), Online publication date: 1-Feb-2003.

Chen J (2003). Optimizing stable in-place merging, Theoretical Computer Science, 302:1-3, (191-210), Online publication date: 13-Jun-2003.

Aggarwal C, Wolf J and Yu P (2019). Adaptive Piggybacking Schemes for Video-On-Demand Systems, Multimedia Tools and Applications, 16:3, (231-250), Online publication date: 1-Mar-2002.

Czyzowicz J, Kranakis E, Krizanc D, Pelc A and Martin M (2002). Enhancing hyperlink structure for improving web performance, Journal of Web Engineering, 1:2, (93-127), Online publication date: 1-Apr-2002.

Khoromskij B and Melenk J (2018). An efficient direct solver for the boundary concentrated FEM in 2D, Computing, 69:2, (91-117), Online publication date: 1-Oct-2002.

Cucker F (2002). Real Computations with Fake Numbers, Journal of Complexity, 18:1, (104-134), Online publication date: 1-Mar-2002.

Annibali A and Bellini F (2002). Bingo pricing, ACM SIGAPL APL Quote Quad, 32:4, (27-34), Online publication date: 1-Jun-2002.

Annibali A and Bellini F Bingo pricing Proceedings of the 2002 conference on APL: array processing languages: lore, problems, and applications, (27-34)

Ingarden R (2019). Open Systems and Consciousness. A Physical Discussion, Open Systems & Information Dynamics, 9:4, (339-369), Online publication date: 23-Dec-2002.

Akhavi A (2002). Random lattices, threshold phenomena and efficient reduction algorithms, Theoretical Computer Science, 287:2, (359-385), Online publication date: 28-Sep-2002.

Turner P (2019). Residue polynomial systems, Theoretical Computer Science, 279:1-2, (29-49), Online publication date: 28-May-2002.

Hitczenko P, Rousseau C and Savage C (2002). A generating functionology approach to a problem of Wilf, Journal of Computational and Applied Mathematics, 142:1, (107-114), Online publication date: 1-May-2002.

Snoeren A, Partridge C, Sanchez L, Jones C, Tchakountio F, Schwartz B, Kent S and Strayer W (2002). Single-packet IP traceback, IEEE/ACM Transactions on Networking (TON), 10:6, (721-734), Online publication date: 1-Dec-2002.

Finocchiaro D and Pellegrini M (2002). On computing the diameter of a point set in high dimensional Euclidean space, Theoretical Computer Science, 287:2, (501-514), Online publication date: 28-Sep-2002.

Adin R and Roichman Y (2018). Descent Functions and Random Young Tableaux, Combinatorics, Probability and Computing, 10:3, (187-201), Online publication date: 1-May-2001.

Bonet B and Geffner H (2019). Planning and Control in Artificial Intelligence, Applied Intelligence, 14:3, (237-252), Online publication date: 9-May-2001.

Alt H The nearest neighbor Computational Discrete Mathematics, (13-24)

Staude G, Flachenecker C, Daumer M and Wolf W (2001). Onset detection in surface electromyographic signals, EURASIP Journal on Advances in Signal Processing, 2001:1, (67-81), Online publication date: 1-Jan-2001.

Reis R and Moreira N (2001). Apoo, ACM SIGCSE Bulletin, 33:4, (43-47), Online publication date: 1-Dec-2001.

Gopal R, Ramesh R and Zionts S (2001). Criss-Cross Hash Joins, IEEE Transactions on Knowledge and Data Engineering, 13:4, (637-653), Online publication date: 1-Jul-2001.

JaJa J (2018). A Perspective on Quicksort, Computing in Science and Engineering, 2:1, (43-49), Online publication date: 1-Jan-2000.

Reed B How tall is a tree? Proceedings of the thirty-second annual ACM symposium on Theory of computing, (479-483)

Theodoridis Y, Stefanakis E and Sellis T (2000). Efficient Cost Models for Spatial Queries Using R-Trees, IEEE Transactions on Knowledge and Data Engineering, 12:1, (19-32), Online publication date: 1-Jan-2000.

Merzbacher M Teaching database management systems with Java Proceedings of the thirty-first SIGCSE technical symposium on Computer science education, (31-35)

Leung H, Feng L and Li Q Analysis of Distributed Database Access Histories for Buffer Allocation Proceedings of the First International Conference on Web Information Systems Engineering (WISE'00)-Volume 2 - Volume 2

Lee L, Scheuermann P and Vingralek R (2000). File Assignment in Parallel I/O Systems with Minimal Variance of Service Time, IEEE Transactions on Computers, 49:2, (127-140), Online publication date: 1-Feb-2000.

Merzbacher M (2000). Teaching database management systems with Java, ACM SIGCSE Bulletin, 32:1, (31-35), Online publication date: 1-Mar-2000.

Guo P, Cheng C and Yoshimura T An O-tree representation of non-slicing floorplan and its applications Proceedings of the 36th annual ACM/IEEE Design Automation Conference, (268-273)

Seysen M (1999). A Measure for the Non-Orthogonality of a Lattice Basis, Combinatorics, Probability and Computing, 8:3, (281-291), Online publication date: 1-May-1999.

Aggarwal C, Wolf J, Yu P and Epelman M (1999). Using Unbalanced Trees for Indexing Multidimensional Objects, Knowledge and Information Systems, 1:3, (309-336), Online publication date: 1-Aug-1999.

Coron J Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems, (292-302)

Kirschenhofer P and Prodinger H (2018). Comparisons in Hoare's Find Algorithm, Combinatorics, Probability and Computing, 7:1, (111-120), Online publication date: 1-Mar-1998.

Fix J and Ladner R (1998). Sorting by Parallel Insertion on a One-Dimensional Subbus Array, IEEE Transactions on Computers, 47:11, (1267-1281), Online publication date: 1-Nov-1998.

Eggen R Key addressable data storage Proceedings of the 36th annual Southeast regional conference, (189-193)

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.

Vingralek R, Breitbart Y and Weikum G (2019). Snowball, Distributed and Parallel Databases, 6:2, (117-156), Online publication date: 1-Apr-1998.

Zhu H and Kinzel W (1998). Antipredictable Sequences: Harder to Predict Than Random Sequences, Neural Computation, 10:8, (2219-2230), Online publication date: 1-Nov-1998.

Waheed A, Rover D and Hollingsworth J (1998). Modeling and Evaluating Design Alternatives for an On-Line Instrumentation System, IEEE Transactions on Software Engineering, 24:6, (451-470), Online publication date: 1-Jun-1998.

Sidhu D and Wijesinha A (2019). Performance analysis of a constrained resource sharing system, Queueing Systems: Theory and Applications, 29:2/4, (293-311), Online publication date: 15-May-1998.

Jebelean T Practical integer division with Karatsuba complexity Proceedings of the 1997 international symposium on Symbolic and algebraic computation, (339-341)

Corless R, Jeffrey D and Knuth D A sequence of series for the Lambert W function Proceedings of the 1997 international symposium on Symbolic and algebraic computation, (197-204)

Goldstein R and Wagner C (1997). Database Management with Sequence Trees and Tokens, IEEE Transactions on Knowledge and Data Engineering, 9:1, (186-192), Online publication date: 1-Jan-1997.

Wang O and Kennedy W (1997). Application of numerical interval analysis to obtain self-validating results for multivariate probabilities in a massively parallel environment, Statistics and Computing, 7:3, (163-171), Online publication date: 1-Aug-1997.

Daudé H, Flajolet P and Vallée B (2018). An Average-Case Analysis of the Gaussian Algorithm for Lattice Reduction, Combinatorics, Probability and Computing, 6:4, (397-433), Online publication date: 1-Dec-1997.

Babai L Paul Erdös (1913-996) Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, (383-401)

Kimm H Maximum crossing number algorithm on linear array with a reconfigurable pipelined bus system Proceedings of the 35th Annual Southeast Regional Conference, (60-62)

Cutting D and Pedersen J Space optimizations for total ranking Computer-Assisted Information Searching on Internet, (401-412)

Yang Y and Wang J Wide-Sense Nonblocking Clos Networks under Packing Strategy Proceedings of the 11th International Symposium on Parallel Processing, (45-54)

Karpinski M, Larmore L and Rytter W Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, (36-41)

Gustafson J and Aluru S (1996). Massively Parallel Searching for Better Algorithms or How to Do a Cross Product with Five Multiplications, Scientific Programming, 5:3, (203-217), Online publication date: 1-Aug-1996.

Van Oorschot P and Wiener M On diffie-hellman key agreement with short exponents Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques, (332-343)

Richardson D, Salvy B, Shackell J and Van der Hoeven J Asymptotic expansions of exp-log functions Proceedings of the 1996 international symposium on Symbolic and algebraic computation, (309-313)

Beresford-Smith B, Diessel O and ElGindy H (2019). Optimal Algorithms for Constrained Reconfigurable Meshes, Journal of Parallel and Distributed Computing, 39:1, (74-78), Online publication date: 1-Nov-1996.

Theodoridis Y and Sellis T A model for the prediction of R-tree performance Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (161-171)

Litwin W, Neimat M and Schneider D (1996). LH*—a scalable, distributed data structure, ACM Transactions on Database Systems (TODS), 21:4, (480-525), Online publication date: 1-Dec-1996.

Flajolet P, Gourdon X and Dumas P (2019). Mellin transforms and asymptotics, Theoretical Computer Science, 144:1, (3-58), Online publication date: 26-Jun-1995.

Lee C and Chang Z (1995). Utilizing Page-Level Join Index for Optimization in Parallel Join Execution, IEEE Transactions on Knowledge and Data Engineering, 7:6, (900-914), Online publication date: 1-Dec-1995.

Fortes J and Cam H (1995). A Fast VLSI-Efficient Self-Routing Permutation Network, IEEE Transactions on Computers, 44:3, (448-453), Online publication date: 1-Mar-1995.

Andersson A, Hagerup T, Nilsson S and Raman R Sorting in linear time? Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (427-436)

Teuhola J Effective clustering of objects stored by linear hashing Proceedings of the fourth international conference on Information and knowledge management, (274-280)

Lin C, Chang C and Lee R (1995). A New Public-Key Cipher System Based Upon the Diophantine Equations, IEEE Transactions on Computers, 44:1, (13-19), Online publication date: 1-Jan-1995.

Yen I and Bastani F (1995). Parallel Hashing, Journal of Parallel and Distributed Computing, 31:2, (190-198), Online publication date: 1-Dec-1995.

Okeefe M and Dietz H (2019). Static Barrier MIMD, Journal of Parallel and Distributed Computing, 25:2, (126-132), Online publication date: 1-Mar-1995.

Gopal R and Ramesh R (1995). The Query Clustering Problem, IEEE Transactions on Knowledge and Data Engineering, 7:6, (885-899), Online publication date: 1-Dec-1995.

Odlyzko A Search for the maximum of a random walk Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (336-345)

Hagerup T Optimal parallel string algorithms Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (382-391)

Chen S, Fuchs W and Hwu W An Analytical Approach to Scheduling Code for Superscalar and VLIW Architectures Proceedings of the 1994 International Conference on Parallel Processing - Volume 01, (285-292)

Lu H and Tan K (1994). Load-Balanced Join Processing in Shared-Nothing Systems, Journal of Parallel and Distributed Computing, 23:3, (382-398), Online publication date: 1-Dec-1994.

Lee D and Batcher K On Sorting Multiple Bitonic Sequences Proceedings of the 1994 International Conference on Parallel Processing - Volume 01, (121-125)

Spuler D (2019). Optimal search trees using two-way key comparisons, Acta Informatica, 31:8, (729-740), Online publication date: 1-Aug-1994.

van Oorschot P and Wiener M Parallel collision search with application to hash functions and discrete logarithms Proceedings of the 2nd ACM Conference on Computer and communications security, (210-218)

Man Y and Wright F Fast polynomial dispersion computation and its application to indefinite summation Proceedings of the international symposium on Symbolic and algebraic computation, (175-180)

Clark D and Weng L (1994). Maximal and Near-Maximal Shift Register Sequences, IEEE Transactions on Computers, 43:5, (560-568), Online publication date: 1-May-1994.

Kröll B and Widmayer P Distributing a search tree among a growing number of processors Proceedings of the 1994 ACM SIGMOD international conference on Management of data, (265-276)

Kröll B and Widmayer P (2019). Distributing a search tree among a growing number of processors, ACM SIGMOD Record, 23:2, (265-276), Online publication date: 1-Jun-1994.

Raman R (1994). A simpler analysis of algorithm 65 (find), ACM SIGACT News, 25:2, (86-89), Online publication date: 1-Jun-1994.

Flajolet P, Zimmermann P and Van Cutsem B (2019). A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, 132:1, (1-35), Online publication date: 26-Sep-1994.

Salvy B (1994). Fast Computation of Some Asymptotic Functional Inverses, Journal of Symbolic Computation, 17:3, (227-236), Online publication date: 1-Mar-1994.

Bieri H and Grimm F (2019). Approaching classical algorithms in APL2, ACM SIGAPL APL Quote Quad, 24:1, (33-40), Online publication date: 1-Sep-1993.

Giancarlo R and Grossi R Parallel construction and query of suffix trees for two-dimensional matrices Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures, (86-97)

Bieri H and Grimm F Approaching classical algorithms in APL2 Proceedings of the international conference on APL, (33-40)

Li L (2018). Fast In-Place Verification of Data Dependencies, IEEE Transactions on Knowledge and Data Engineering, 5:2, (266-281), Online publication date: 1-Apr-1993.

Flajolet P, Gonnet G, Puech C and Robson J (2018). Analytic variations on quadtrees, Algorithmica, 10:6, (473-500), Online publication date: 1-Dec-1993.

Crawford D (1993). Technical correspondence, Communications of the ACM, 36:7, (105), Online publication date: 1-Jul-1993.

Vaishnav H and Pedram M Routability-driven fanout optimization Proceedings of the 30th international Design Automation Conference, (230-235)

Chandra K (1993). A set of programming projects for a second programming course, ACM SIGCSE Bulletin, 25:2, (51-56), Online publication date: 1-Jun-1993.

Niederreiter H (2019). A new efficient factorization algorithm for polynomials over small finite fields, Applicable Algebra in Engineering, Communication and Computing, 4:2, (81-87), Online publication date: 1-Jun-1993.

Tharp A and Furlani J The CD-ROM foster a new data structure Proceedings of the 1993 ACM conference on Computer science, (466-471)

Rackoff C and Simon D Cryptographic defense against traffic analysis Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (672-681)

Cutting D, Kupiec J, Pedersen J and Sibun P A practical part-of-speech tagger Proceedings of the third conference on Applied natural language processing, (133-140)

Tan K and Lu H Processing multi-join query in parallel systems Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's, (283-292)

Panti M and Valenti S (1992). A modulus oriented hash function for the construction of minimal perfect tables, ACM SIGPLAN Notices, 27:11, (33-38), Online publication date: 1-Nov-1992.

Yokoo H (2019). Overflow/Underflow-Free Floating-Point Number Representations with Self-Delimiting Variable-Length Exponent Field, IEEE Transactions on Computers, 41:8, (1033-1039), Online publication date: 1-Aug-1992.

Biliris A (2019). The performance of three database storage structures for managing large objects, ACM SIGMOD Record, 21:2, (276-285), Online publication date: 1-Jun-1992.

Biliris A The performance of three database storage structures for managing large objects Proceedings of the 1992 ACM SIGMOD international conference on Management of data, (276-285)

Surles M An algorithm with linear complexity for interactive, physically-based modeling of large proteins Proceedings of the 19th annual conference on Computer graphics and interactive techniques, (221-230)

Surles M (1992). An algorithm with linear complexity for interactive, physically-based modeling of large proteins, ACM SIGGRAPH Computer Graphics, 26:2, (221-230), Online publication date: 1-Jul-1992.

Zhang W and Wen Z Efficient parallel algorithms for some integer problems Proceedings of the 19th annual conference on Computer Science, (11-20)

Yen I Massively parallel hash algorithms and performance Proceedings of the 19th annual conference on Computer Science, (21-28)

Trono J (1991). Average case analysis when merging two ordered lists of different length, ACM SIGCSE Bulletin, 23:3, (5-6), Online publication date: 1-Sep-1991.

Krammer J (2018). A sorter-based architecture for a parallel implementation of communication intensive algorithms, Journal of VLSI Signal Processing Systems, 3:1-2, (93-103), Online publication date: 1-May-1991.

Vose M (2019). A Linear Algorithm for Generating Random Numbers with a Given Distribution, IEEE Transactions on Software Engineering, 17:9, (972-975), Online publication date: 1-Sep-1991.

Johnsonbaugh R and Kalin M (1991). A graph generation software package, ACM SIGCSE Bulletin, 23:1, (151-154), Online publication date: 1-Mar-1991.

Johnsonbaugh R and Kalin M A graph generation software package Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, (151-154)

Smith D (1991). Algorithm 693: a FORTRAN package for floating-point multiple-precision arithmetic, ACM Transactions on Mathematical Software (TOMS), 17:2, (273-283), Online publication date: 1-Jun-1991.

Negri M and Pelagatti G (1991). Distributive join, ACM Transactions on Database Systems (TODS), 16:4, (655-669), Online publication date: 1-Dec-1991.

Cutting D, Pedersen J and Halvorsen P An object-oriented architecture for text retrieval Intelligent Text and Image Handling, (285-298)

Computer Science and Technology Board C (1990). Scaling up: a research agenda for software engineering, Communications of the ACM, 33:3, (281-293), Online publication date: 1-Mar-1990.

Heller F Finding parents in a heap Proceedings of the 28th annual Southeast regional conference, (217-222)

Lakshmi M and Yu P (2018). Effectiveness of Parallel Joins, IEEE Transactions on Knowledge and Data Engineering, 2:4, (410-424), Online publication date: 1-Dec-1990.

Cutting D and Pedersen J Optimization for dynamic inverted index maintenance Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval, (405-411)

Durst M Using linear congruential generators for parallel random number generation Proceedings of the 21st conference on Winter simulation, (462-466)

Fiat A Batch RSA Proceedings on Advances in cryptology, (175-185)

Schmeck H, Schröder H and Starke C (2019). Systolic s/sup 2/-Way Merge Sort is Optimal, IEEE Transactions on Computers, 38:7, (1052-1056), Online publication date: 1-Jul-1989.

Lueker G and Molodowitch M More analysis of double hashing Proceedings of the twentieth annual ACM symposium on Theory of computing, (354-359)

Larson P (1988). Dynamic hash tables, Communications of the ACM, 31:4, (446-457), Online publication date: 1-Apr-1988.

Manber U (1988). Using induction to design algorithms, Communications of the ACM, 31:11, (1300-1313), Online publication date: 1-Nov-1988.

Knobloch H A smart card implementation of the Fiat-Shamir identification scheme Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88, (87-95)

Sung Y and Lee D Self-organizing scheme for file storage Proceedings of the 1988 ACM sixteenth annual conference on Computer science, (147-160)

Huang B and Langston M (1988). Practical in-place merging, Communications of the ACM, 31:3, (348-352), Online publication date: 1-Mar-1988.

Sung Y Sensitivity problem in dynamic file organization Proceedings of the 15th annual conference on Computer Science, (149-153)

Raita T and Teuhola J Predictive test compression by hashing Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval, (223-233)

McEntee T (1987). Overview of garbage collection in symbolic computing, ACM SIGPLAN Lisp Pointers, 1:3, (8-16), Online publication date: 1-Aug-1987.

Stasko J and Vitter J (1987). Pairing heaps, Communications of the ACM, 30:3, (234-249), Online publication date: 1-Mar-1987.

Lengauer C and Huang C A mechanically certified theorem about optimal concurrency of sorting networks Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (307-317)

Jones L and Simon J Hierarchical VLSI design systems based on attribute grammars Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (58-69)

Garg A and Gotlieb C (1986). Order-preserving key transformations, ACM Transactions on Database Systems, 11:2, (213-234), Online publication date: 1-Jun-1986.

Sacco G (1986). Fragmentation: a technique for efficient query processing, ACM Transactions on Database Systems, 11:2, (113-133), Online publication date: 1-Jun-1986.

Stout Q and Warren B (1986). Tree rebalancing in optimal time and space, Communications of the ACM, 29:9, (902-908), Online publication date: 1-Sep-1986.

Pal A (1986). An Algorithm for Optimal Logic Design Using Multiplexers, IEEE Transactions on Computers, 35:8, (755-757), Online publication date: 1-Aug-1986.

Ito T and Yu C Optimization of a hierarchical file organization for spelling correction Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval, (131-137)

Ahad R A list-based storage for personal databases Proceedings of the 1985 ACM SIGSMALL symposium on Small systems, (155-165)

Niederreiter H (1985). The serial test for pseudo-random numbers generated by the linear congruential method, Numerische Mathematik, 46:1, (51-68), Online publication date: 1-Mar-1985.

Huang S (1985). Height-balanced trees of order (β, γ, δ), ACM Transactions on Database Systems (TODS), 10:2, (261-284), Online publication date: 1-Jun-1985.

Vitter J (1985). An efficient I/O interface for optical disks, ACM Transactions on Database Systems (TODS), 10:2, (129-162), Online publication date: 1-Jun-1985.

Bentley J and McGeoch C (1985). Amortized analyses of self-organizing sequential search heuristics, Communications of the ACM, 28:4, (404-411), Online publication date: 1-Apr-1985.

Takagi N and Wong C (1985). A hardware sort-merge system, IBM Journal of Research and Development, 29:1, (49-67), Online publication date: 1-Jan-1985.

Gabow H, Bentley J and Tarjan R Scaling and related techniques for geometry problems Proceedings of the sixteenth annual ACM symposium on Theory of computing, (135-143)

Orenstein J and Merrett T A class of data structures for associative searching Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems, (181-190)

Valduriez P and Gardarin G (1984). Join and Semijoin Algorithms for a Multiprocessor Database Machine, ACM Transactions on Database Systems, 9:1, (133-161), Online publication date: 23-Mar-1984.

Marwedel P The mimola design system Proceedings of the 21st Design Automation Conference, (587-593)

McGeer P (1984). A discussion and implementation of Brown's REX simplification algorithm, ACM SIGSAM Bulletin, 18:1, (10-19), Online publication date: 1-Feb-1984.

Niederreiter H (1984). The Performance of k-Step Pseudorandom Number Generators under the Uniformity Test, SIAM Journal on Scientific and Statistical Computing, 5:4, (798-810), Online publication date: 1-Dec-1984.

Pritchard P (1984). Some negative results concerning prime number generators, Communications of the ACM, 27:1, (53-57), Online publication date: 1-Jan-1984.

Cooper R and Solomon M (1984). The average time until bucket overflow, ACM Transactions on Database Systems (TODS), 9:3, (392-408), Online publication date: 1-Sep-1984.

Christodoulakis S (1984). Implications of certain assumptions in database performance evauation, ACM Transactions on Database Systems, 9:2, (163-186), Online publication date: 3-Jun-1984.

Chen W and Vitter J (1984). Analysis of new variants of coalesced hashing, ACM Transactions on Database Systems, 9:4, (616-645), Online publication date: 5-Dec-1984.

Regener E (1984). Multiprecision integer division examples using arbitrary radix, ACM Transactions on Mathematical Software, 10:3, (325-328), Online publication date: 28-Aug-1984.

Nishihara S and Ikeda K (1983). Reducing the retrieval time of hashing method by using predictors, Communications of the ACM, 26:12, (1082-1088), Online publication date: 1-Dec-1983.

Gonnet G (1983). Balancing binary trees by internal path reduction, Communications of the ACM, 26:12, (1074-1081), Online publication date: 1-Dec-1983.

(2018). The Complexity of Vertex Enumeration Methods, Mathematics of Operations Research, 8:3, (381-402), Online publication date: 1-Aug-1983.

Dowd M, Perl Y, Saks M and Rudolph L The balanced sorting network Proceedings of the second annual ACM symposium on Principles of distributed computing, (161-172)

Fushimi M and Tezuka S (1983). The k-distribution of generalized feedback shift register pseudorandom numbers, Communications of the ACM, 26:7, (516-523), Online publication date: 1-Jul-1983.

Tierney L (2018). A Space-Efficient Recursive Procedure for Estimating a Quantile of an Unknown Distribution, SIAM Journal on Scientific and Statistical Computing, 4:4, (706-711), Online publication date: 1-Dec-1983.

Dodds D (1982). Reducing dictionary size by using a hashing technique, Communications of the ACM, 25:6, (368-370), Online publication date: 1-Jun-1982.

Dong J and Hull R Applying approximate order dependency to reduce indexing space Proceedings of the 1982 ACM SIGMOD international conference on Management of data, (119-127)

Gonnet G and Larson P External hasing with limited internal storage Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, (256-261)

Ahrens J and Dieter U (1982). Generating gamma variates by a modified rejection technique, Communications of the ACM, 25:1, (47-54), Online publication date: 1-Jan-1982.

Cercone N, Krause M and Boates J (1981). Lexicon design using perfect hash functions, ACM SIGSOC Bulletin, 13:2-3, (69-78), Online publication date: 1-Jan-1982.

Vikas O and Rajaraman V (1982). Searching in a dynamic memory with fast sequential access, Communications of the ACM, 25:7, (479-484), Online publication date: 1-Jul-1982.

Dewar R, Merritt S and Sharir M (1982). Some modified algorithms for Dijkstra's longest upsequence problem, Acta Informatica, 18:1, (1-15), Online publication date: 1-Mar-1982.

Batory D and Gotlieb C (1982). A unifying model of physical databases, ACM Transactions on Database Systems, 7:4, (509-539), Online publication date: 1-Dec-1982.

Andrews G, Dobkin D and Downey P Distributed allocation with pools of servers Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (73-83)

Sherman M, Hisgen A and Rosenberg J A methodology for programming abstract data types in Ada Proceedings of the AdaTEC Conference on Ada, (66-75)

Cercone N, Krause M and Boates J Lexicon design using perfect hash functions Proceedings of the Joint Conference on Easier and More Productive Use of Computer Systems. (Part - II): Human Interface and the User Interface - Volume 1981, (69-78)

Sidney J (1981). A Decomposition Algorithm for Sequencing with General Precedence Constraints, Mathematics of Operations Research, 6:2, (190-204), Online publication date: 1-May-1981.

Kruskal C and Weixelbaum E (1981). A note on the worst case of heapsort, ACM SIGACT News, 13:1, (35-38), Online publication date: 1-Jan-1981.

Galil Z and Paul W An efficient general purpose parallel computer Proceedings of the thirteenth annual ACM symposium on Theory of computing, (247-262)

Quittner P, Csóka S, Halász S, Kotsis D and Várnai K (1981). Comparison of synonym handling and bucket organization methods, Communications of the ACM, 24:9, (579-583), Online publication date: 1-Sep-1981.

McCormack W and Sargent R (1981). Analysis of future event set algorithms for discrete event simulation, Communications of the ACM, 24:12, (801-812), Online publication date: 1-Dec-1981.

Cook C and Kim D (1980). Best sorting algorithm for nearly sorted lists, Communications of the ACM, 23:11, (620-624), Online publication date: 1-Nov-1980.

Bentley J (1980). Multidimensional divide-and-conquer, Communications of the ACM, 23:4, (214-229), Online publication date: 1-Apr-1980.

Samet H (1980). Deletion in two-dimensional quad trees, Communications of the ACM, 23:12, (703-710), Online publication date: 1-Dec-1980.

Vuillemin J (1980). A unifying look at data structures, Communications of the ACM, 23:4, (229-239), Online publication date: 1-Apr-1980.

Supowit K, Plaisted D and Reingold E Heuristics for weighted perfect matching Proceedings of the twelfth annual ACM symposium on Theory of computing, (398-419)

Preparata F (1979). An optimal real-time algorithm for planar convex hulls, Communications of the ACM, 22:7, (402-405), Online publication date: 1-Jul-1979.

Tai K (1979). On the implementation of parsing tables, ACM SIGPLAN Notices, 14:1, (100-101), Online publication date: 1-Jan-1979.

Jones B (1979). Teaching algorithm design, ACM SIGCSE Bulletin, 11:4, (27-30), Online publication date: 1-Dec-1979.

Monma C and Sidney J (2018). Sequencing with Series-Parallel Precedence Constraints, Mathematics of Operations Research, 4:3, (215-224), Online publication date: 1-Aug-1979.

Babb E (1979). Implementing a relational database by means of specialzed hardware, ACM Transactions on Database Systems, 4:1, (1-29), Online publication date: 1-Mar-1979.

Comer D (1979). Heuristics for trie index minimization, ACM Transactions on Database Systems, 4:3, (383-395), Online publication date: 1-Sep-1979.

Burkhard W (1979). Partial-match hash coding, ACM Transactions on Database Systems, 4:2, (228-239), Online publication date: 1-Jun-1979.

Aho A and Ullman J (1979). Optimal partial-match retrieval when fields are independently specified, ACM Transactions on Database Systems, 4:2, (168-179), Online publication date: 1-Jun-1979.

Fagin R, Nievergelt J, Pippenger N and Strong H (1979). Extendible hashing—a fast access method for dynamic files, ACM Transactions on Database Systems, 4:3, (315-344), Online publication date: 1-Sep-1979.

Räihä K and Zweben S (1979). An optimal insertion algorithm for one-sided height-balanced binary search trees, Communications of the ACM, 22:9, (508-512), Online publication date: 1-Sep-1979.

DeWitt H Applications of the theory of random graphs to average algorithm performance analysis Proceedings of the 1979 annual conference, (251-258)

Knuth D Structured programming with go to statements Classics in software engineering, (257-321)

Driscoll J and Lien Y (1978). A selective traversal algorithm for binary search trees, Communications of the ACM, 21:6, (445-447), Online publication date: 1-Jun-1978.

Gries D and Misra J (1978). A linear sieve algorithm for finding prime numbers, Communications of the ACM, 21:12, (999-1003), Online publication date: 1-Dec-1978.

Kosaraju S (1978). Insertions and deletions in one-sided height-balanced trees, Communications of the ACM, 21:3, (226-227), Online publication date: 1-Mar-1978.

Lipski W (2019). On strings containing all subsets as substrings, Discrete Mathematics, 21:3, (253-259), Online publication date: 1-May-1978.

Luccio F and Pagli L (1978). Power trees, Communications of the ACM, 21:11, (941-947), Online publication date: 1-Nov-1978.

Sheil B (1978). Median split trees, Communications of the ACM, 21:11, (947-958), Online publication date: 1-Nov-1978.

Fredman M and Weide B (1978). On the complexity of computing the measure of ∪[ai,bi], Communications of the ACM, 21:7, (540-544), Online publication date: 1-Jul-1978.

Heckel P (1978). A technique for isolating differences between files, Communications of the ACM, 21:4, (264-268), Online publication date: 1-Apr-1978.

Vuillemin J (1978). A data structure for manipulating priority queues, Communications of the ACM, 21:4, (309-315), Online publication date: 1-Apr-1978.

Hirschberg D (1978). Fast parallel sorting algorithms, Communications of the ACM, 21:8, (657-661), Online publication date: 1-Aug-1978.

Ottmann T, Six H and Wood D (1978). Right brother trees, Communications of the ACM, 21:9, (769-776), Online publication date: 1-Sep-1978.

McKinney M Variable-length hash area entries Proceedings of the June 13-16, 1977, national computer conference, (371-377)

McKinney M Multi-attribute inverted files implemented with hashing Proceedings of the 15th annual Southeast regional conference, (371-376)

Ashenhurst R (1977). ACM forum, Communications of the ACM, 20:9, (678-680), Online publication date: 1-Sep-1977.

Liskov B, Snyder A, Atkinson R and Schaffert C (1977). Abstraction mechanisms in CLU, Communications of the ACM, 20:8, (564-576), Online publication date: 1-Aug-1977.

Maruyama K and Smith S (1977). Analysis of design alternatives for virtual memory indexes, Communications of the ACM, 20:4, (245-254), Online publication date: 1-Apr-1977.

Thompson C and Kung H (1977). Sorting on a mesh-connected parallel computer, Communications of the ACM, 20:4, (263-271), Online publication date: 1-Apr-1977.

Bird R (1977). Notes on recursion elimination, Communications of the ACM, 20:6, (434-439), Online publication date: 1-Jun-1977.

Yap C (1976). New upper bounds for selection, Communications of the ACM, 19:9, (501-508), Online publication date: 1-Sep-1976.

Reiter A Some experiments in directory organization - a simulation study Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, (1-9)

Lee D and Preparata F Location of a point in a planar subdivision and its applications Proceedings of the eighth annual ACM symposium on Theory of computing, (231-235)

Giordano N and Schwartz M Data base recovery at CMIC Proceedings of the 1976 ACM SIGMOD international conference on Management of data, (33-42)

Naur P (1975). Programming languages, natural languages, and mathematics, Communications of the ACM, 18:12, (676-683), Online publication date: 1-Dec-1975.

Wegbreit B (1975). Mechanical program analysis, Communications of the ACM, 18:9, (528-539), Online publication date: 1-Sep-1975.

Baumgart B A polyhedron representation for computer vision Proceedings of the May 19-22, 1975, national computer conference and exposition, (589-596)

Manacher G On the feasibility of implementing a large relational data base with optimal performance on a minicomputer Proceedings of the 1st International Conference on Very Large Data Bases, (175-201)

Bahr K and Smit J (1974). Tuning an algebraic manipulation system through measurements, ACM SIGSAM Bulletin, 8:3, (17-23), Online publication date: 1-Aug-1974.

Cardenas A (1973). Evaluation and selection of file organization—a model and system, Communications of the ACM, 16:9, (540-548), Online publication date: 1-Sep-1973.