Browse Books

Jang M, Ko Y, Gwon H, Jo I, Park Y and Kim S SAGE: A Storage-Based Approach for Scalable and Efficient Sparse Generalized Matrix-Matrix Multiplication Proceedings of the 32nd ACM International Conference on Information and Knowledge Management, (923-933)

Ji J, Li C, Wang J, Li S, Zhang Y and Yang Y (2023). A collaborative recursive generalized exponential functional link artificial neural network nonlinear filter based on optional parameter entry method, Digital Signal Processing, 142:C, Online publication date: 1-Oct-2023.

Kehl C, Nooteboom P, Kaandorp M and van Sebille E (2023). Efficiently simulating Lagrangian particles in large-scale ocean flows — Data structures and their impact on geophysical applications, Computers & Geosciences, 175:C, Online publication date: 1-Jun-2023.

Jang M, Ko Y, Jeong D, Park J and Kim S RealGraphGPU: A High-Performance GPU-Based Graph Engine toward Large-Scale Real-World Network Analysis Proceedings of the 31st ACM International Conference on Information & Knowledge Management, (4074-4078)

Henzinger M and Wu X Upper and Lower Bounds for Fully Retroactive Graph Problems Algorithms and Data Structures, (471-484)

Nadschläger S, Hofer D, Küng J and Jäger M Data Structures for a Generic Software System using the Composite Design Pattern Proceedings of the 26th European Conference on Pattern Languages of Programs, (1-7)

Troendle D, Ta T and Jang B A Specialized Concurrent Queue for Scheduling Irregular Workloads on GPUs Proceedings of the 48th International Conference on Parallel Processing, (1-11)

Goel S and Kumar R (2018). Brownian Motus and Clustered Binary Insertion Sort methods, Future Generation Computer Systems, 86:C, (266-280), Online publication date: 1-Sep-2018.

Liew C and Nguyen H Determining What the Student Understands - Assessment in an Unscaffolded Environment Intelligent Tutoring Systems, (339-344)

Tran H and Cambria E (2018). A survey of graph processing on graphics processing units, The Journal of Supercomputing, 74:5, (2086-2115), Online publication date: 1-May-2018.

Zwerger M, Neuner M and Graeb H Power-Down Circuit Synthesis for Analog/Mixed-Signal Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, (656-663)

Zwerger M and Graeb H Detection of asymmetric aging-critical voltage conditions in analog power-down mode Proceedings of the 2015 Design, Automation & Test in Europe Conference & Exhibition, (1269-1272)

Höner zu Siederdissen C (2012). Sneaking around concatMap, ACM SIGPLAN Notices, 47:9, (215-226), Online publication date: 15-Oct-2012.

Höner zu Siederdissen C Sneaking around concatMap Proceedings of the 17th ACM SIGPLAN international conference on Functional programming, (215-226)

Gil J, Goldstein M and Moshkovich D An empirical investigation of changes in some software properties over time Proceedings of the 9th IEEE Working Conference on Mining Software Repositories, (227-236)

Gil Y, Goldstein M and Moshkovich D How much information do software metrics contain? Proceedings of the 3rd ACM SIGPLAN workshop on Evaluation and usability of programming languages and tools, (57-64)

Dannecker L, Schulze R, Böhm M, Lehner W and Hackenbroich G Context-aware parameter estimation for forecast models in the energy domain Proceedings of the 23rd international conference on Scientific and statistical database management, (491-508)

Hiser J, Williams D, Hu W, Davidson J, Mars J and Childers B (2011). Evaluating indirect branch handling mechanisms in software dynamic translation systems, ACM Transactions on Architecture and Code Optimization, 8:2, (1-28), Online publication date: 1-Jul-2011.

Bell T and Aspvall B Sorting algorithms as special cases of a priority queue sort Proceedings of the 42nd ACM technical symposium on Computer science education, (123-128)

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

Martinez C, Pandya D and Lin W (2009). On designing fast nonuniformly distributed IP address lookup hashing algorithms, IEEE/ACM Transactions on Networking (TON), 17:6, (1916-1925), Online publication date: 1-Dec-2009.

Mai J and Scherer M (2009). Efficiently sampling exchangeable Cuadras-Augé copulas in high dimensions, Information Sciences: an International Journal, 179:17, (2872-2877), Online publication date: 1-Aug-2009.

Freydenberger D and Reidenbach D (2009). The unambiguity of segmented morphisms, Discrete Applied Mathematics, 157:14, (3055-3068), Online publication date: 15-Jul-2009.

Monteiro S and Erbacher R (2019). An authentication and validation mechanism for analyzing syslogs forensically, ACM SIGOPS Operating Systems Review, 42:3, (41-50), Online publication date: 1-Apr-2008.

Eidenbenz S, Resta G and Santi P (2008). The COMMIT Protocol for Truthful and Cost-Efficient Routing in Ad Hoc Networks with Selfish Nodes, IEEE Transactions on Mobile Computing, 7:1, (19-33), Online publication date: 1-Jan-2008.

Okasha H and Rösler U (2007). Asymptotic distributions for Random Median Quicksort, Journal of Discrete Algorithms, 5:3, (592-608), Online publication date: 1-Sep-2007.

Rathi Y, Vaswani N, Tannenbaum A and Yezzi A (2007). Tracking Deforming Objects Using Particle Filtering for Geometric Active Contours, IEEE Transactions on Pattern Analysis and Machine Intelligence, 29:8, (1470-1475), Online publication date: 1-Aug-2007.

Kybic J High-dimensional entropy estimation for finite accuracy data Proceedings of the 20th international conference on Information processing in medical imaging, (569-580)

Zhang R, Oliveira B, Bivens A and McKeever S Scalable problem localization for distributed systems Proceedings of the 2nd international conference on Scalable information systems, (1-8)

Hiser J, Williams D, Hu W, Davidson J, Mars J and Childers B Evaluating Indirect Branch Handling Mechanisms in Software Dynamic Translation Systems Proceedings of the International Symposium on Code Generation and Optimization, (61-73)

Stefanakis E (2007). NET-DBSCAN, International Journal of Geographical Information Science, 21:4, (427-442), Online publication date: 4-Jan-2007.

Forouzan A and Garth L (2007). Computationally efficient partial crosstalk cancellation in fast time-varying DSL crosstalk environments, EURASIP Journal on Advances in Signal Processing, 2007:1, (42-42), Online publication date: 1-Jan-2007.

Bertini M, Del Bimbo A and Nunziati W Automatic detection of player's identity in soccer videos using faces and text cues Proceedings of the 14th ACM international conference on Multimedia, (663-666)

Blumenkrants M, Starovisky H and Shamir A Narrative algorithm visualization Proceedings of the 2006 ACM symposium on Software visualization, (17-26)

Steffen P and Giegerich R (2006). Table design in dynamic programming, Information and Computation, 204:9, (1325-1345), Online publication date: 1-Sep-2006.

Nebel M (2006). Fast string matching by using probabilities, Theoretical Computer Science, 359:1, (329-343), Online publication date: 14-Aug-2006.

Elsenhans A and Jahnel J The asymptotics of points of bounded height on diagonal cubic and quartic threefolds Proceedings of the 7th international conference on Algorithmic Number Theory, (317-332)

Kahrs S Genetic programming with primitive recursion Proceedings of the 8th annual conference on Genetic and evolutionary computation, (941-942)

Tarim S, Hnich B, Rossi R and Prestwich S Cost-based filtering for stochastic inventory control Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints, (169-183)

Lobo A and Baliga G (2006). NP-completeness for all computer science undergraduates, Journal of Computing Sciences in Colleges, 21:6, (53-63), Online publication date: 1-Jun-2006.

Laszlo M and Mukherjee S (2005). Minimum Spanning Tree Partitioning Algorithm for Microaggregation, IEEE Transactions on Knowledge and Data Engineering, 17:7, (902-911), Online publication date: 1-Jul-2005.

Lee Y and Atiquzzaman M (2005). Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem, Computer Communications, 28:11, (1371-1379), Online publication date: 1-Jul-2005.

Belanovic P, Knerr B, Holzer M, Sauzon G and Rupp M (2005). A consistent design methodology for wireless embedded systems, EURASIP Journal on Advances in Signal Processing, 2005, (2598-2612), Online publication date: 1-Jan-2005.

Dong L and Watters C Improving Efficiency and Relevance Ranking in Information Retrieval Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence, (648-651)

Litwin W and Schwarz T Algebraic Signatures for Scalable Distributed Data Structures Proceedings of the 20th International Conference on Data Engineering

Marwedel P, Wehmeyer L, Verma M, Steinke S and Helmig U Fast, predictable and low energy memory references through architecture-aware compilation Proceedings of the 2004 Asia and South Pacific Design Automation Conference, (4-11)

Aycock J (2003). The ART of compiler construction projects, ACM SIGPLAN Notices, 38:12, (28-32), Online publication date: 1-Dec-2003.

Clarke K (2003). Geocomputation's future at the extremes, Parallel Computing, 29:10, (1281-1295), Online publication date: 1-Oct-2003.

Lee J, Lee S and Lee S A framework of winner determination algorithms for internet auctions Proceedings of the 2nd international conference on Human.society@internet, (415-424)

Blieberger J and Burgstaller B Eliminating redundant range checks in GNAT using symbolic evaluation Proceedings of the 8th Ada-Europe international conference on Reliable software technologies, (153-167)

Blieberger J, Burgstaller B and Scholz B Busy wait analysis Proceedings of the 8th Ada-Europe international conference on Reliable software technologies, (142-152)

Nilsson B and Heyden A (2003). A fast algorithm for level set-like active contours, Pattern Recognition Letters, 24:9-10, (1331-1337), Online publication date: 1-Jun-2003.

Verma M, Steinke S and Marwedel P Data partitioning for maximal scratchpad usage Proceedings of the 2003 Asia and South Pacific Design Automation Conference, (77-83)

Grabmeier J, Kaltofen E and Weispfenning V Cited References Computer algebra handbook, (493-622)

Blieberger J (2019). Data-Flow Frameworks for Worst-Case Execution Time Analysis, Real-Time Systems, 22:3, (183-227), Online publication date: 1-May-2002.

Lee S, Jeon M, Kim D and Sohn A (2002). Partitioned Parallel Radix Sort, Journal of Parallel and Distributed Computing, 62:4, (656-668), Online publication date: 1-Apr-2002.

Sanders I (2002). Teaching empirical analysis of algorithms, ACM SIGCSE Bulletin, 34:1, (321-325), Online publication date: 1-Mar-2002.

Sanders I Teaching empirical analysis of algorithms Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (321-325)

Nebel M (2002). The stack-size of tries, Theoretical Computer Science, 270:1-2, (441-461), Online publication date: 6-Jan-2002.

Suraweera F (2001). Getting the most from an algorithms design course, ACM SIGCSE Bulletin, 33:4, (71-74), Online publication date: 1-Dec-2001.

Martin P (2019). A Hardware Implementation of a Genetic Programming System Using FPGAs and Handel-C, Genetic Programming and Evolvable Machines, 2:4, (317-343), Online publication date: 1-Dec-2001.

Yadgari J, Amir A and Unger R (2019). Genetic Threading, Constraints, 6:2/3, (271-292), Online publication date: 1-Jun-2001.

Kimmel R and Sethian J (2019). Optimal Algorithm for Shape from Shading and Path Planning, Journal of Mathematical Imaging and Vision, 14:3, (237-244), Online publication date: 1-May-2001.

Anwar M and Yoshida T Integrating OO road network database, cases and knowledge for route finding Proceedings of the 2001 ACM symposium on Applied computing, (215-219)

Dyn N, Floater M and Iske A Univariate adaptive thinning Mathematical Methods for Curves and Surfaces, (123-134)

Miura T, Matsumoto W, Shioya I and Wada Y Extensible perfect hashing Proceedings of the ninth international conference on Information and knowledge management, (446-452)

Estivill-Castro V and Yang J Fast and robust general purpose clustering algorithms Proceedings of the 6th Pacific Rim international conference on Artificial intelligence, (208-218)

Levitin A Design and analysis of algorithms reconsidered Proceedings of the thirty-first SIGCSE technical symposium on Computer science education, (16-20)

McNab R, Smith L, Witten I and Henderson C (2000). Tune Retrieval in the Multimedia Library, Multimedia Tools and Applications, 10:2-3, (113-132), Online publication date: 1-Apr-2000.

Anwar M and Yoshida T OORF Proceedings of the 2000 ACM symposium on Applied computing - Volume 1, (301-306)

Levitin A (2000). Design and analysis of algorithms reconsidered, ACM SIGCSE Bulletin, 32:1, (16-20), Online publication date: 1-Mar-2000.

Wermelinger M and Fiadeiro J (2019). Algebraic software architecture reconfiguration, ACM SIGSOFT Software Engineering Notes, 24:6, (393-409), Online publication date: 1-Nov-1999.

Cukier M, Chandra R, Henke D, Pistole J and Sanders W Fault Injection Based on a Partial View of the Global State of a Distributed System Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems

Wermelinger M and Fiadeiro J Algebraic software architecture reconfiguration Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering, (393-409)

Khan M, Paul R, Ahmed I and Ghafoor A (1999). Intensive Data Management in Parallel Systems, Distributed and Parallel Databases, 7:4, (383-414), Online publication date: 1-Oct-1999.

Levitin A Do we teach the right algorithm design techniques? The proceedings of the thirtieth SIGCSE technical symposium on Computer science education, (179-183)

Levitin A (1999). Do we teach the right algorithm design techniques?, ACM SIGCSE Bulletin, 31:1, (179-183), Online publication date: 1-Mar-1999.

Puschner P (1999). Real-Time Performance of Sorting Algorithms, Real-Time Systems, 16:1, (63-79), Online publication date: 1-Jan-1999.

Graefe G, Bunker R and Cooper S Hash Joins and Hash Teams in Microsoft SQL Server Proceedings of the 24rd International Conference on Very Large Data Bases, (86-97)

Snyder J and Lengyel J Visibility sorting and compositing without splitting for image layer decompositions Proceedings of the 25th annual conference on Computer graphics and interactive techniques, (219-230)

Dobkin D, Gansner E, Koutsofios E and North S A path router for graph drawing Proceedings of the fourteenth annual symposium on Computational geometry, (415-416)

Droste S, Jansen T and Wegener I (1998). A rigorous complexity analysis of the (1 + 1) evolutionary algorithm for separable functions with boolean inputs, Evolutionary Computation, 6:2, (185-196), Online publication date: 1-Jun-1998.

Goodrich M and Tamassia R (1998). Teaching the analysis of algorithms with visual proofs, ACM SIGCSE Bulletin, 30:1, (207-211), Online publication date: 1-Mar-1998.

Ferri F and Albert J (1998). Average-case analysis in an elementary course on algorithms, ACM SIGCSE Bulletin, 30:1, (202-206), Online publication date: 1-Mar-1998.

Goodrich M and Tamassia R Teaching the analysis of algorithms with visual proofs Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education, (207-211)

Ferri F and Albert J Average-case analysis in an elementary course on algorithms Proceedings of the twenty-ninth SIGCSE technical symposium on Computer science education, (202-206)

Clément J, Flajolet P and Vallée B The analysis of hybrid trie structures Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (531-539)

Frank A and Raubal M (1998). Formal specification of image schemata -- a steptowards interoperability in geographic informationsystems, Spatial Cognition and Computation, 1:1, (67-101), Online publication date: 1-Jan-1998.

Lengauer C, Gorlatch S and Herrmann C (2019). The Static Parallelization of Loops and Recursions, The Journal of Supercomputing, 11:4, (333-353), Online publication date: 1-Dec-1997.

Parashar M, Browne J, Edwards C and Klimkowski K A common data management infrastructure for adaptive algorithms for PDE solutions Proceedings of the 1997 ACM/IEEE conference on Supercomputing, (1-22)

Reps T, Ball T, Das M and Larus J (1997). The use of program profiling for software maintenance with applications to the year 2000 problem, ACM SIGSOFT Software Engineering Notes, 22:6, (432-449), Online publication date: 1-Nov-1997.

Reps T, Ball T, Das M and Larus J The use of program profiling for software maintenance with applications to the year 2000 problem Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering, (432-449)

Li S and Danzig P (1997). Boolean Similarity Measures for Resource Discovery, IEEE Transactions on Knowledge and Data Engineering, 9:6, (863-876), Online publication date: 1-Nov-1997.

Rautama E, Sutinen E and Tarhio J (1997). Excel as an algorithm animation environment, ACM SIGCSE Bulletin, 29:3, (24-26), Online publication date: 1-Sep-1997.

Cohen L and Kimmel R (2019). Global Minimum for Active Contour Models, International Journal of Computer Vision, 24:1, (57-78), Online publication date: 1-Aug-1997.

Novak G (1997). Software Reuse by Specialization of Generic Procedures through Views, IEEE Transactions on Software Engineering, 23:7, (401-417), Online publication date: 1-Jul-1997.

Rautama E, Sutinen E and Tarhio J Excel as an algorithm animation environment Proceedings of the 2nd conference on Integrating technology into computer science education, (24-26)

Zmuda M and Tamburino L (1996). Efficient Algorithms for the Soft Morphological Operators, IEEE Transactions on Pattern Analysis and Machine Intelligence, 18:11, (1142-1147), Online publication date: 1-Nov-1996.

Mitzenmacher M (2019). Designing stimulating programming assignments for an algorithms course, ACM SIGCSE Bulletin, 28:3, (29-36), Online publication date: 1-Sep-1996.

Olstad B and Torp A (1996). Encoding of a priori Information in Active Contour Models, IEEE Transactions on Pattern Analysis and Machine Intelligence, 18:9, (863-872), Online publication date: 1-Sep-1996.

Andersson A and Brodnik A (1996). Comment on “self-indexed sort”, ACM SIGPLAN Notices, 31:8, (40-41), Online publication date: 1-Aug-1996.

Naps T (1996). Algorithm visualization served off the World Wide Web, ACM SIGCSE Bulletin, 28:SI, (66-71), Online publication date: 2-Jun-1996.

Naps T Algorithm visualization served off the World Wide Web Proceedings of the 1st conference on Integrating technology into computer science education, (66-71)

McNab R, Smith L, Witten I, Henderson C and Cunningham S Towards the digital music library Proceedings of the first ACM international conference on Digital libraries, (11-18)

Van Genderen A, van der Meijs N and Smedes T Fast Computation of Substrate Resistances in Large Circuits Proceedings of the 1996 European conference on Design and Test

LaMarca A and Ladner R (1996). The influence of caches on the performance of heaps, Journal of Experimental Algorithmics (JEA), 1, (4-es), Online publication date: 1-Jan-1996.

Naps T (1996). Algorithm visualization served off the World Wide Web, ACM SIGCUE Outlook, 24:1-3, (66-71), Online publication date: 1-Jan-1996.

Schwoerer L, Lück M and Schröder H Integration of VHDL into a system design environment Proceedings of the conference on European design automation, (268-273)

Baeza-Yates R (2019). Teaching algorithms, ACM SIGACT News, 26:4, (51-59), Online publication date: 1-Dec-1995.

Röjemo N Highlights from nhc—a space-efficient Haskell compiler Proceedings of the seventh international conference on Functional programming languages and computer architecture, (282-292)

Tillison J and Shene C (1995). On generating worst-cases for the insertion sort, ACM SIGCSE Bulletin, 27:2, (57-58), Online publication date: 1-Jun-1995.

Wolf J, Turek J, Chen M and Yu P (2019). A Hierarchical Approach to Parallel Multiquery Scheduling, IEEE Transactions on Parallel and Distributed Systems, 6:6, (578-590), Online publication date: 1-Jun-1995.

Tal A and Dobkin D (1995). Visualization of Geometric Algorithms, IEEE Transactions on Visualization and Computer Graphics, 1:2, (194-204), Online publication date: 1-Jun-1995.

Fanm J and Su K (1995). The Design of Efficient Algorithms for Two-Dimensional Pattern Matching, IEEE Transactions on Knowledge and Data Engineering, 7:2, (318-327), Online publication date: 1-Apr-1995.

Van Genderen A Network initialization in a switch-level simulator Proceedings of the 1995 European conference on Design and Test

Mehlhorn K and Näher S (1995). LEDA: a platform for combinatorial and geometric computing, Communications of the ACM, 38:1, (96-102), Online publication date: 2-Jan-1995.

Moy J (1994). Multicast routing extensions for OSPF, Communications of the ACM, 37:8, (61-ff.), Online publication date: 1-Aug-1994.

Salisbury M, Anderson S, Barzel R and Salesin D Interactive pen-and-ink illustration Proceedings of the 21st annual conference on Computer graphics and interactive techniques, (101-108)

Wolf J, Turek J, Chen M and Yu P (2019). Scheduling multiple queries on a parallel machine, ACM SIGMETRICS Performance Evaluation Review, 22:1, (45-55), Online publication date: 1-May-1994.

Wolf J, Turek J, Chen M and Yu P Scheduling multiple queries on a parallel machine Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems, (45-55)

Visweswariah C and Wehbeh J Incremental event-driven simulation of digital FET circuits Proceedings of the 30th international Design Automation Conference, (737-741)

Hoogenboom P and Lepreau J Computer system performance problem detection using time series models Proceedings of the USENIX Summer 1993 Technical Conference on Summer technical conference - Volume 1, (1-21)

Mueller C, Rock S and Sanders I An improved first year course taking into account third world students Proceedings of the twenty-fourth SIGCSE technical symposium on Computer science education, (213-217)

Mueller C, Rock S and Sanders I (1993). An improved first year course taking into account third world students, ACM SIGCSE Bulletin, 25:1, (213-217), Online publication date: 1-Mar-1993.

Strate S and Wainwright R Load balancing techniques for dynamic programming algorithms on hypercube multiprocessors Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (562-569)

Sekharan D and Wainwright R Manipulating subpopulations of feasible and infeasible solutions in genetic algorithms Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (118-125)

Banâtre J and Le Métayer D (1993). Programming by multiset transformation, Communications of the ACM, 36:1, (98-111), Online publication date: 1-Jan-1993.

Li Y and Jabri M A zero-skew clock routing scheme for VLSI circuits Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, (458-463)

Seda S, Degrauwe M and Fichtner W Lazy-expansion symbolic expression approximation in SYNAP Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, (310-317)

Palczewski M Plane parallel a maze router and its application to FPGAs Proceedings of the 29th ACM/IEEE Design Automation Conference, (691-697)

Robertson A and Willett P Searching for historical word-forms in a database of 17th-century English text using spelling-correction methods Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval, (256-265)

Barron S, Witten M and Liu G (2019). A bibliography on computational molecular biology and genetics, Mathematical and Computer Modelling: An International Journal, 16:6-7, (245-319), Online publication date: 1-Jun-1992.

Cohen E, Miller R, Sarraf E and Stout Q (1992). Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers, Algorithmica, 7:1-6, (51-75), Online publication date: 1-Jun-1992.

Chazelle B and Edelsbrunner H (1992). An optimal algorithm for intersecting line segments in the plane, Journal of the ACM (JACM), 39:1, (1-54), Online publication date: 2-Jan-1992.

Fox E, Heath L, Chen Q and Daoud A (1992). Practical minimal perfect hash functions for large databases, Communications of the ACM, 35:1, (105-121), Online publication date: 2-Jan-1992.

Fraser C (1991). A retargetable compiler for ANSI C, ACM SIGPLAN Notices, 26:10, (29-43), Online publication date: 1-Oct-1991.

Botafogo R and Shneiderman B Identifying aggregates in hypertext structures Proceedings of the third annual ACM conference on Hypertext, (63-74)

Reichenberger C Delta storage for arbitrary non-text files Proceedings of the 3rd international workshop on Software configuration management, (144-152)

Rönngren R, Riboe J and Ayani R Lazy queue Proceedings of the 24th annual symposium on Simulation, (194-204)

Rönngren R, Riboe J and Ayani R (1991). Lazy queue, ACM SIGSIM Simulation Digest, 21:3, (194-204), Online publication date: 1-Apr-1991.

Flajolet P, Gonnet G, Puech C and Robson J The analysis of multidimensional searching in quad-trees Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, (100-109)

Pucheral P, Thévenin J and Valduriez P Efficient Main Memory Data Management Using the DBGraph Storage Model Proceedings of the 16th International Conference on Very Large Data Bases, (683-695)

Bentley J K-d trees for semidynamic point sets Proceedings of the sixth annual symposium on Computational geometry, (187-197)

Wallace S Exploiting non-inherent parallelism in an internal mergesort Proceedings of the 28th annual Southeast regional conference, (159-164)

Pintado X and Tsichritzis D (2019). SaTellite: a visualization and navigation tool for hypermedia, ACM SIGOIS Bulletin, 11:2-3, (271-280), Online publication date: 1-Apr-1990.

Pintado X and Tsichritzis D SaTellite: a visualization and navigation tool for hypermedia Proceedings of the ACM SIGOIS and IEEE CS TC-OA conference on Office information systems, (271-280)

Hsu W, Fisher C and Goodman J (1989). On the Minimization of Loads/Stores in Local Register Allocation, IEEE Transactions on Software Engineering, 15:10, (1252-1260), Online publication date: 1-Oct-1989.

Merritt S (1989). A top down unification of minimum cost spanning tree algorithms, ACM SIGCOMM Computer Communication Review, 19:4, (116-127), Online publication date: 1-Aug-1989.

Merritt S A top down unification of minimum cost spanning tree algorithms Symposium proceedings on Communications architectures & protocols, (116-127)

Jonsson D (1989). Next: the elimination of Goto-patches?, ACM SIGPLAN Notices, 24:3, (85-92), Online publication date: 1-Mar-1989.

Koh H Flow network reduction for unique topological ordering Proceedings of the 17th conference on ACM Annual Computer Science Conference, (335-338)

Oommen B and Ng D On generating random permutations with arbitrary distributions Proceedings of the 17th conference on ACM Annual Computer Science Conference, (27-32)

Armenise P (2019). A structured approach to program optimization, IEEE Transactions on Software Engineering, 15:2, (101-108), Online publication date: 1-Feb-1989.

Rubinstein D, Shallit J and Szegedy M (1988). A subset coloring algorithm and its applications to computer graphics, Communications of the ACM, 31:10, (1228-1232), Online publication date: 1-Oct-1988.

Lathrop R, Hall R, Duffy G, Alexander K and Kirk R Advances in functional abstraction from structure Proceedings of the 25th ACM/IEEE Design Automation Conference, (708-711)

Vivier B, Simmons M and Masline S Annotator: an AI approach to engineering drawing annotation Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1, (447-455)

Brown M (2019). Exploring Algorithms Using Balsa-II, Computer, 21:5, (14-36), Online publication date: 1-May-1988.

Rolfe T (1988). Generations of permutations with non-unique elements, ACM SIGNUM Newsletter, 23:2, (24-28), Online publication date: 1-Apr-1988.

Low J An implementation of the Vernian Cipher for file security Proceedings of the 1988 ACM sixteenth annual conference on Computer science, (597-601)

Wilfong G Motion planning in the presence of movable obstacles Proceedings of the fourth annual symposium on Computational geometry, (279-288)

Golin M and Sedgewick R Analysis of a simple yet efficient convex hull algorithm Proceedings of the fourth annual symposium on Computational geometry, (153-163)

Musser D and Stepanov A A library of generic algorithms in Ada Proceedings of the 1987 annual ACM SIGAda international conference on Ada, (216-225)

Fortune S (1987). A sweepline algorithm for Voronoi diagrams, Algorithmica, 2:1-4, (153-174), Online publication date: 1-Nov-1987.

Wainwright R Quicksort algorithms with an early exit for sorted subfiles Proceedings of the 15th annual conference on Computer Science, (183-190)

Hartman J and Chrisman C Providing activities for students to apply data structures concepts Proceedings of the eighteenth SIGCSE technical symposium on Computer science education, (336-342)

Hartman J and Chrisman C (1987). Providing activities for students to apply data structures concepts, ACM SIGCSE Bulletin, 19:1, (336-342), Online publication date: 1-Feb-1987.

Louden K (1987). Recursion versus non-recursion in Pascal: recursion can be faster, ACM SIGPLAN Notices, 22:2, (62-67), Online publication date: 1-Feb-1987.

Holliday M and Vernon M The GTPN analyzer Proceedings of 1986 ACM Fall joint computer conference, (1099-1105)

Carlson D Time-space tradeoffs for tree search and traversal Proceedings of 1986 ACM Fall joint computer conference, (585-594)

Sedgewick R and Vitter J (1986). Shortest paths in euclidean graphs, Algorithmica, 1:1-4, (31-48), Online publication date: 1-Nov-1986.

Kay T and Kajiya J Ray tracing complex scenes Proceedings of the 13th annual conference on Computer graphics and interactive techniques, (269-278)

Kay T and Kajiya J (1986). Ray tracing complex scenes, ACM SIGGRAPH Computer Graphics, 20:4, (269-278), Online publication date: 31-Aug-1986.

Fortune S A sweepline algorithm for Voronoi diagrams Proceedings of the second annual symposium on Computational geometry, (313-322)

Duisberg R Animated graphical interfaces using temporal constraints Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, (131-136)

Duisberg R (2019). Animated graphical interfaces using temporal constraints, ACM SIGCHI Bulletin, 17:4, (131-136), Online publication date: 1-Apr-1986.

Brown M and Sedgewick R (1984). A system for algorithm animation, ACM SIGGRAPH Computer Graphics, 18:3, (177-186), Online publication date: 1-Jul-1984.

Tamminen M and Samet H (1984). Efficient octree conversion by connectivity labeling, ACM SIGGRAPH Computer Graphics, 18:3, (43-51), Online publication date: 1-Jul-1984.

Vitter J (1984). Faster methods for random sampling, Communications of the ACM, 27:7, (703-718), Online publication date: 1-Jul-1984.

Brown M and Sedgewick R (1984). Progress report, ACM SIGCSE Bulletin, 16:1, (91-101), Online publication date: 1-Feb-1984.

Brown M and Sedgewick R Progress report Proceedings of the fifteenth SIGCSE technical symposium on Computer science education, (91-101)

Brown M and Sedgewick R A system for algorithm animation Proceedings of the 11th annual conference on Computer graphics and interactive techniques, (177-186)

Tamminen M and Samet H Efficient octree conversion by connectivity labeling Proceedings of the 11th annual conference on Computer graphics and interactive techniques, (43-51)

Brown M and Meyrowitz N Personal computer networks and graphical animation Proceedings of the fourteenth SIGCSE technical symposium on Computer science education, (296-307)

Brown M and Meyrowitz N (1983). Personal computer networks and graphical animation, ACM SIGCSE Bulletin, 15:1, (296-307), Online publication date: 1-Feb-1983.