Abstract
No abstract available.
Cited By
- Nakasato N, Murakami Y, Kono F and Nakata M Evaluation of POSIT Arithmetic with Accelerators Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region, (62-72)
- Prammer M and Patel J (2023). Rethinking the Encoding of Integers for Scans on Skewed Data, Proceedings of the ACM on Management of Data, 1:4, (1-27), Online publication date: 8-Dec-2023.
- Swartvagher P, Hunold S, Träff J and Vardas I Using Mixed-Radix Decomposition to Enumerate Computational Resources of Deeply Hierarchical Architectures Proceedings of the SC '23 Workshops of The International Conference on High Performance Computing, Network, Storage, and Analysis, (405-415)
- Chen Q, Zhang T, Nie M, Wang Z, Xu S, Shi W and Cao Z Fashion-GPT: Integrating LLMs with Fashion Retrieval System Proceedings of the 1st Workshop on Large Generative Models Meet Multimodal Applications, (69-78)
- Bodenham D and Kawahara Y (2023). euMMD: efficiently computing the MMD two-sample test statistic for univariate data, Statistics and Computing, 33:5, Online publication date: 1-Oct-2023.
- Chen Y, Chen Y and Zhang Y (2023). Evaluation of Reachability Queries Based on Recursive DAG Decomposition, IEEE Transactions on Knowledge and Data Engineering, 35:8, (7935-7952), Online publication date: 1-Aug-2023.
- Xu H, Li A, Wheatman B, Marneni M and Pandey P (2023). BP-Tree: Overcoming the Point-Range Operation Tradeoff for In-Memory B-Trees, Proceedings of the VLDB Endowment, 16:11, (2976-2989), Online publication date: 1-Jul-2023.
- Lazaro J, Garcia R, Linsangan N, Pellegrino R, Aranda R, Bundoc G and Granada N Electrooculography for control of Emoji board for Patients with Classical Locked-in Syndrome using Proceedings of the 2023 13th International Conference on Biomedical Engineering and Technology, (116-123)
- Cook S The 1982 ACM Turing Award Lecture Logic, Automata, and Computational Complexity, (47-70)
- Raskar S, Applencourt T, Kumaran K and Gao G Towards Maximum Throughput of Dataflow Software Pipeline under Resource Constraints Proceedings of the 14th International Workshop on Programming Models and Applications for Multicores and Manycores, (20-28)
- Lee J, Kim Y, Ryu Y, Sodsong W, Jeon H, Park J, Burgstaller B and Scholz B Julia Cloud Matrix Machine: Dynamic Matrix Language Acceleration on Multicore Clusters in the Cloud Proceedings of the 14th International Workshop on Programming Models and Applications for Multicores and Manycores, (1-10)
- Abdulaziz M and Kurz F Formally verified SAT-based AI planning Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence, (14665-14673)
- Cui Y, Wu S, Li Q, Chan A, Kuo T and Xue C (2022). Bits-Ensemble: Toward Light-Weight Robust Deep Ensemble by Bits-Sharing, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 41:11, (4397-4408), Online publication date: 1-Nov-2022.
- Akashi S, Takagi M and Iwata T Bidirectional remote connections among virtual ICT laboratories ranging over multiple network segments Proceedings of the 5th International Conference on Computer Science and Software Engineering, (492-496)
- Ngo T and Williams A Entropy Lost: Nintendo’s Not-So-Random Sequence of 32, 767 Bits Proceedings of the 17th International Conference on the Foundations of Digital Games, (1-10)
- Marzougui S, Wisiol N, Gersch P, Krämer J and Seifert J Machine-Learning Side-Channel Attacks on the GALACTICS Constant-Time Implementation of BLISS Proceedings of the 17th International Conference on Availability, Reliability and Security, (1-11)
- Karppa M and Pagh R HyperLogLogLog Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, (753-761)
- Meiryani M, Aliffiyah L, Endrianto W, Kerta J, Meriana M and Dewiyanti S Factors Affecting Taxpayer's Ability To Pay Tax In Indonesia Proceedings of the 2022 13th International Conference on E-business, Management and Economics, (522-528)
- Mahmoudi A and Ahmadi M (2022). 2DNCF-PIT: Two-Dimensional Neighbor-Based Cuckoo Filter for Pending Interest Table Lookup in Named Data Networking, Journal of Network and Systems Management, 30:3, Online publication date: 1-Jul-2022.
- Seok M, Tan W, Su B and Cai W Hyperparameter Tunning in Simulation-based Optimization for Adaptive Digital-Twin Abstraction Control of Smart Manufacturing System Proceedings of the 2022 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation, (61-68)
- Muller M and Strohmayer A Forgetting Practices in the Data Sciences Proceedings of the 2022 CHI Conference on Human Factors in Computing Systems, (1-19)
- Yun J, Kim J, Hwang W, Kim Y, Woo S and Min B Residual size is not enough for anomaly detection Proceedings of the 37th ACM/SIGAPP Symposium on Applied Computing, (87-96)
- Uher V and Kromer P Lehmer Encoding for Evolutionary Algorithms on Traveling Salesman Problem Proceedings of the 2022 7th International Conference on Machine Learning Technologies, (216-222)
- Greif H (2022). Analogue Models and Universal Machines. Paradigms of Epistemic Transparency in Artificial Intelligence, Minds and Machines, 32:1, (111-133), Online publication date: 1-Mar-2022.
- Blackman D and Vigna S (2021). Scrambled Linear Pseudorandom Number Generators, ACM Transactions on Mathematical Software, 47:4, (1-32), Online publication date: 31-Dec-2022.
- Srivastava A, Chockalingam S, Aluru M and Aluru S Parallel construction of module networks Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (1-14)
- Häcker C, Bouros P, Chondrogiannis T and Althaus E Most Diverse Near-Shortest Paths Proceedings of the 29th International Conference on Advances in Geographic Information Systems, (229-239)
- Karizat N, Delmonaco D, Eslami M and Andalibi N (2021). Algorithmic Folk Theories and Identity: How TikTok Users Co-Produce Knowledge of Identity and Engage in Algorithmic Resistance, Proceedings of the ACM on Human-Computer Interaction, 5:CSCW2, (1-44), Online publication date: 13-Oct-2021.
- Shahin R Towards Assurance-Driven Architectural Decomposition of Software Systems Computer Safety, Reliability, and Security. SAFECOMP 2021 Workshops, (187-196)
- Adams A (2021). Fast median filters using separable sorting networks, ACM Transactions on Graphics, 40:4, (1-11), Online publication date: 31-Aug-2021.
- Chopin N, Gartrell M, Liang D, Lumbreras A, Rohde D and Wang Y Bayesian Causal Inference for Real World Interactive Systems Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, (4114-4115)
- Akashi S and Tong Y A Vulnerability of Dynamic Network Address Translation to Denial-of-Service Attacks 2021 4th International Conference on Data Science and Information Technology, (226-230)
- Liang Z, Hu H and Zhu J LPF: A Language-Prior Feedback Objective Function for De-biased Visual Question Answering Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, (1955-1959)
- Gomes A, Oliveirinha J, Cardoso P and Bizarro P (2021). Railgun, Proceedings of the VLDB Endowment, 14:12, (3069-3082), Online publication date: 1-Jul-2021.
- Akashi S and Tong Y On the Distributed DoS Attacks Targeting at the Bottlenecked Links Proceedings of the 2021 2nd International Conference on Computing, Networks and Internet of Things, (1-7)
- Cai W, Bernstein P, Wu W and Chandramouli B (2021). Optimization of threshold functions over streams, Proceedings of the VLDB Endowment, 14:6, (878-889), Online publication date: 1-Feb-2021.
- Barabasz B, Anderson A, Soodhalter K and Gregg D (2020). Error Analysis and Improving the Accuracy of Winograd Convolution for Deep Neural Networks, ACM Transactions on Mathematical Software, 46:4, (1-33), Online publication date: 31-Dec-2021.
- Liu J Simulus Proceedings of the Winter Simulation Conference, (2329-2340)
- Carreira-Perpiñán M and Zharmagambetov A Ensembles of Bagged TAO Trees Consistently Improve over Random Forests, AdaBoost and Gradient Boosting Proceedings of the 2020 ACM-IMS on Foundations of Data Science Conference, (35-46)
- Ewart T, Cremonesi F, Schürmann F and Delalondre F (2020). Polynomial Evaluation on Superscalar Architecture, Applied to the Elementary Function e, ACM Transactions on Mathematical Software, 46:3, (1-22), Online publication date: 30-Sep-2020.
- Ben-Eliezer O and Yogev E The Adversarial Robustness of Sampling Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, (49-62)
- Jaiswal A, Liu H and Frommholz I Information Foraging for Enhancing Implicit Feedback in Content-based Image Recommendation Proceedings of the 11th Annual Meeting of the Forum for Information Retrieval Evaluation, (65-69)
- Bannister H, Selwyn-Smith B, Anslow C, Robinson B, PhD R, Pires D, Kane P and Leong A LINACVR: VR Simulation for Radiation Therapy Education Proceedings of the 25th ACM Symposium on Virtual Reality Software and Technology, (1-10)
- Ferradi H and Naccache D Integer Reconstruction Public-Key Encryption Cryptology and Network Security, (412-433)
- Katz D, Schieber B and Shachnai H (2019). Flexible Resource Allocation to Interval Jobs, Algorithmica, 81:8, (3217-3244), Online publication date: 1-Aug-2019.
- Chen W The Art of Telescoping Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, (1-3)
- Black A (2019). Importance sampling for partially observed temporal epidemic models, Statistics and Computing, 29:4, (617-630), Online publication date: 1-Jul-2019.
- Bharadhwaj H and Srivastava N New Tab Page Recommendations Strongly Concentrate Web Browsing to Familiar Sources Proceedings of the 10th ACM Conference on Web Science, (7-16)
- Karnakov P, Wermelinger F, Chatzimanolakis M, Litvinov S and Koumoutsakos P A High Performance Computing Framework for Multiphase, Turbulent Flows on Structured Grids Proceedings of the Platform for Advanced Scientific Computing Conference, (1-9)
- Belson B, Holdsworth J, Xiang W and Philippa B (2019). A Survey of Asynchronous Programming Using Coroutines in the Internet of Things and Embedded Systems, ACM Transactions on Embedded Computing Systems, 18:3, (1-21), Online publication date: 31-May-2019.
- Kreyndelin V, Smirnov A and Rejeb T A New Approach of Implementation of MMSE Demodulator for Massive MIMO Systems Proceedings of the 24th Conference of Open Innovations Association FRUCT, (193-199)
- Du R, He J and Yun X (2019). Counting Vertices with Given Outdegree in Plane Trees and k-ary Trees, Graphs and Combinatorics, 35:1, (221-229), Online publication date: 1-Jan-2019.
- Lee W, Heo K, Alur R and Naik M (2018). Accelerating search-based program synthesis using learned probabilistic models, ACM SIGPLAN Notices, 53:4, (436-449), Online publication date: 2-Dec-2018.
- Fegan J, Coleman S, Kerr D and Scotney B Fast, Multi-Scale Image Processing on a Square Spiral Framework Proceedings of the 2018 International Conference on Artificial Intelligence and Pattern Recognition, (57-60)
- Wang Y, Gobriel S, Wang R, Tai T and Dumitrescu C Hash Table Design and Optimization for Software Virtual Switches Proceedings of the 2018 Afternoon Workshop on Kernel Bypassing Networks, (22-28)
- Kozma L and Saranurak T Smooth heaps and a dual view of self-adjusting data structures Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, (801-814)
- Banyassady B, Korman M and Mulzer W (2018). Computational Geometry Column 67, ACM SIGACT News, 49:2, (77-94), Online publication date: 13-Jun-2018.
- Lee W, Heo K, Alur R and Naik M Accelerating search-based program synthesis using learned probabilistic models Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, (436-449)
- Paletti A How to plan an organisational strategy to manage ICTs mediated co-production Proceedings of the 19th Annual International Conference on Digital Government Research: Governance in the Data Age, (1-6)
- Neutens T and Wyffels F Bringing Computer Science Education to Secondary School Proceedings of the 49th ACM Technical Symposium on Computer Science Education, (840-845)
- Sairam A and Verma S Using Bounded Binary Particle Swarm Optimization to Analyze Network Attack Graphs Proceedings of the 19th International Conference on Distributed Computing and Networking, (1-9)
- Naderlinger A Simulating execution time variations in MATLAB/Simulink Proceedings of the 2017 Winter Simulation Conference, (1-12)
- Hellerer M and Buse F Compile-time dynamic and recursive data structures in Modelica Proceedings of the 8th International Workshop on Equation-Based Object-Oriented Modeling Languages and Tools, (81-86)
- C V and P A Secret sharing scheme based on Cauchy matrix for data outsourcing Proceedings of the 10th International Conference on Security of Information and Networks, (315-318)
- Tenner B (2017). Reduced word manipulation, Journal of Algebraic Combinatorics: An International Journal, 46:1, (189-217), Online publication date: 1-Aug-2017.
- Martínez L, Bribiesca E and Guzmán A (2017). Chain coding representation of voxel-based objects with enclosing, edging and intersecting trees, Pattern Analysis & Applications, 20:3, (825-844), Online publication date: 1-Aug-2017.
- Edelkamp S, Elmasry A and Katajainen J (2017). Optimizing Binary Heaps, Theory of Computing Systems, 61:2, (606-636), Online publication date: 1-Aug-2017.
- Bender M, Farach-Colton M, Fekete S, Fineman J and Gilbert S (2017). Cost-Oblivious Storage Reallocation, ACM Transactions on Algorithms, 13:3, (1-20), Online publication date: 31-Jul-2017.
- Ganardi M, Hucke D, Je A, Lohrey M and Noeth E (2017). Constructing small tree grammars and small circuits for formulas, Journal of Computer and System Sciences, 86:C, (136-158), Online publication date: 1-Jun-2017.
- Vigna S (2017). Further scramblings of Marsaglia's xorshift generators, Journal of Computational and Applied Mathematics, 315:C, (175-181), Online publication date: 1-May-2017.
- Tan R, van Leeuwen E and van Leeuwen J (2017). Shortcutting directed and undirected networks with a degree constraint, Discrete Applied Mathematics, 220:C, (91-117), Online publication date: 31-Mar-2017.
- Nikolaos T, Georgopoulos K and Papaefstathiou Y A novel way to efficiently simulate complex full systems incorporating hardware accelerators Proceedings of the Conference on Design, Automation & Test in Europe, (658-661)
- Hein N and Huang J (2017). Modular Catalan numbers, European Journal of Combinatorics, 61:C, (197-218), Online publication date: 1-Mar-2017.
- Krings S and Leuschel M (2017). Inferring physical units in formal models, Software and Systems Modeling (SoSyM), 16:1, (25-47), Online publication date: 1-Feb-2017.
- Pégny M (2016). How to Make a Meaningful Comparison of Models, Minds and Machines, 26:4, (359-388), Online publication date: 1-Dec-2016.
- Longa P and Naehrig M Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography Cryptology and Network Security, (124-139)
- Gessel I (2016). Lagrange inversion, Journal of Combinatorial Theory Series A, 144:C, (212-249), Online publication date: 1-Nov-2016.
- Hesthaven J and Zhang S (2016). On the Use of ANOVA Expansions in Reduced Basis Methods for Parametric Partial Differential Equations, Journal of Scientific Computing, 69:1, (292-313), Online publication date: 1-Oct-2016.
- Opler M (2016). Major index distribution over permutation classes, Advances in Applied Mathematics, 80:C, (131-150), Online publication date: 1-Sep-2016.
- McVicar M, Sach B, Mesnage C, Lijffijt J, Spyropoulou E and De Bie T (2016). SuMoTED, Pattern Recognition Letters, 79:C, (52-59), Online publication date: 1-Aug-2016.
- Lee A and Whiteley N (2016). Forest resampling for distributed sequential Monte Carlo, Statistical Analysis and Data Mining, 9:4, (230-248), Online publication date: 1-Aug-2016.
- Crochemore M, Iliopoulos C, Kociumaka T, Kubica M, Langiu A, Pissis S, Radoszewski J, Rytter W and Waleń T (2016). Order-preserving indexing, Theoretical Computer Science, 638:C, (122-135), Online publication date: 25-Jul-2016.
- Bultel X, Gambs S, Gérault D, Lafourcade P, Onete C and Robert J A Prover-Anonymous and Terrorist-Fraud Resistant Distance-Bounding Protocol Proceedings of the 9th ACM Conference on Security & Privacy in Wireless and Mobile Networks, (121-133)
- Cicirello V (2016). The Permutation in a Haystack Problem and the Calculus of Search Landscapes, IEEE Transactions on Evolutionary Computation, 20:3, (434-446), Online publication date: 1-Jun-2016.
- (2016). Pluriassociative algebras I, Advances in Applied Mathematics, 77:C, (1-42), Online publication date: 1-Jun-2016.
- Morozov D and Lukic Z Master of Puppets Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing, (285-288)
- Laube U and Nebel M (2016). Maximum Likelihood Analysis of the Ford---Fulkerson Method on Special Graphs, Algorithmica, 74:4, (1224-1266), Online publication date: 1-Apr-2016.
- Kamto J, Qian L, Li W and Han Z (2016). λ-Augmented Tree for Robust Data Collection in Advanced Metering Infrastructure, International Journal of Distributed Sensor Networks, 2016, (3), Online publication date: 1-Mar-2016.
- Aruliah D, Veen L and Dubitski A (2016). Algorithm 956, ACM Transactions on Mathematical Software, 42:1, (1-18), Online publication date: 1-Mar-2016.
- Georgiadis L and Tarjan R (2015). Dominator Tree Certification and Divergent Spanning Trees, ACM Transactions on Algorithms, 12:1, (1-42), Online publication date: 8-Feb-2016.
- Kuszmaul B (2015). SuperMalloc: a super fast multithreaded malloc for 64-bit machines, ACM SIGPLAN Notices, 50:11, (41-55), Online publication date: 28-Jan-2016.
- Konyagin S, Luca F, Mans B, Mathieson L, Sha M and Shparlinski I (2016). Functional graphs of polynomials over finite fields, Journal of Combinatorial Theory Series B, 116:C, (87-122), Online publication date: 1-Jan-2016.
- Schreiber A (2015). Multivariate Stirling polynomials of the first and second kind, Discrete Mathematics, 338:12, (2462-2484), Online publication date: 6-Dec-2015.
- Braverman V, Ostrovsky R and Vorsanger G (2015). Weighted sampling without replacement from data streams, Information Processing Letters, 115:12, (923-926), Online publication date: 1-Dec-2015.
- Gracioli G, Alhammad A, Mancuso R, Fröhlich A and Pellizzoni R (2015). A Survey on Cache Management Mechanisms for Real-Time Embedded Systems, ACM Computing Surveys, 48:2, (1-36), Online publication date: 21-Nov-2015.
- Bousquet-Mélou M, Lohrey M, Maneth S and Noeth E (2015). XML Compression via Directed Acyclic Graphs, Theory of Computing Systems, 57:4, (1322-1371), Online publication date: 1-Nov-2015.
- Spyropoulos V and Kotidis Y Building Space-Efficient Inverted Indexes on Low-Cardinality Dimensions Proceedings, Part I, of the 26th International Conference on Database and Expert Systems Applications - Volume 9261, (449-459)
- Kuszmaul B SuperMalloc: a super fast multithreaded malloc for 64-bit machines Proceedings of the 2015 International Symposium on Memory Management, (41-55)
- Bliznets I, Cygan M, Komosa P and Mach L (2015). Kernelization lower bound for Permutation Pattern Matching, Information Processing Letters, 115:5, (527-531), Online publication date: 1-May-2015.
- Kumar A, Jetley R, Nair A, Rath A and Vaidyanathan A Analyzing Dependencies in an Industrial Automation Engineering System Proceedings of the 8th India Software Engineering Conference, (60-69)
- Albert M and Bousquet-Mélou M (2015). Permutations sortable by two stacks in parallel and quarter plane walks, European Journal of Combinatorics, 43:C, (131-164), Online publication date: 1-Jan-2015.
- Skene J Description Logic as Programming Language Proceedings of the 2014 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming & Software, (143-162)
- Bender M, Farach-Colton M, Fekete S, Fineman J and Gilbert S Cost-oblivious storage reallocation Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (278-288)
- Luu L, Shinde S, Saxena P and Demsky B A model counter for constraints over unbounded strings Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, (565-576)
- Luu L, Shinde S, Saxena P and Demsky B (2014). A model counter for constraints over unbounded strings, ACM SIGPLAN Notices, 49:6, (565-576), Online publication date: 5-Jun-2014.
- BjØrner D and Havelund K 40 Years of Formal Methods Proceedings of the 19th International Symposium on FM 2014: Formal Methods - Volume 8442, (42-61)
- Sorge V, Chen C, Raman T and Tseng D Towards making mathematics a first class citizen in general screen readers Proceedings of the 11th Web for All Conference, (1-10)
- Whiting S and Jose J Recent and robust query auto-completion Proceedings of the 23rd international conference on World wide web, (971-982)
- Gunther J (2014). Algorithm 938, ACM Transactions on Mathematical Software, 40:2, (1-12), Online publication date: 1-Feb-2014.
- Goel A, Khanna S, Larkin D and Tarjan R Disjoint set union with randomized linking Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (1005-1017)
- Jagtenberg C, Schwiegelshohn U and Uetz M (2013). Analysis of Smith's rule in stochastic machine scheduling, Operations Research Letters, 41:6, (570-575), Online publication date: 1-Nov-2013.
- Bueno D, Compton K, Sakallah K and Bailey M Detecting Traditional Packers, Decisively Proceedings of the 16th International Symposium on Research in Attacks, Intrusions, and Defenses - Volume 8145, (184-203)
- Ma S (2013). Enumeration of permutations by number of alternating runs, Discrete Mathematics, 313:18, (1816-1822), Online publication date: 28-Sep-2013.
- Bodini O, Gardy D and Jacquot A (2013). Asymptotics and random sampling for BCI and BCK lambda terms, Theoretical Computer Science, 502, (227-238), Online publication date: 1-Sep-2013.
- Thiyagalingam J, Walton S, Duffy B, Trefethen A and Chen M Complexity plots Proceedings of the 15th Eurographics Conference on Visualization, (111-120)
- Huo X, Krishnamoorthy S and Agrawal G Efficient scheduling of recursive control flow on GPUs Proceedings of the 27th international ACM conference on International conference on supercomputing, (409-420)
- Ogaard K, Roy H, Kase S, Nagi R, Sambhoos K and Sudit M Discovering patterns in social networks with graph matching algorithms Proceedings of the 6th international conference on Social Computing, Behavioral-Cultural Modeling and Prediction, (341-349)
- Lohrey M, Maneth S and Noeth E XML compression via DAGs Proceedings of the 16th International Conference on Database Theory, (69-80)
- Widmer S, Wodniok D, Weber N and Goesele M Fast dynamic memory allocator for massively parallel architectures Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units, (120-126)
- Manea F and Tiseanu C (2013). The hardness of counting full words compatible with partial words, Journal of Computer and System Sciences, 79:1, (7-22), Online publication date: 1-Feb-2013.
- Mattheakis P and Papaefstathiou I (2013). Significantly reducing MPI intercommunication latency and power overhead in both embedded and HPC systems, ACM Transactions on Architecture and Code Optimization, 9:4, (1-25), Online publication date: 1-Jan-2013.
- Than C and Rosenberg N (2013). Mathematical Properties of the Deep Coalescence Cost, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 10:1, (61-72), Online publication date: 1-Jan-2013.
- Bezem M, Hovland D and Truong H (2012). A type system for counting instances of software components, Theoretical Computer Science, 458:C, (29-48), Online publication date: 2-Nov-2012.
- Pérez-Solà C and Herrera-Joancomartí J Classifying online social network users through the social graph Proceedings of the 5th international conference on Foundations and Practice of Security, (115-131)
- Castro D, Gomes S and Stolfi J (2012). An adaptive multiresolution method on dyadic grids, Journal of Computational and Applied Mathematics, 236:15, (3636-3646), Online publication date: 1-Sep-2012.
- Broder J and Rusmevichientong P (2012). Dynamic Pricing Under a General Parametric Choice Model, Operations Research, 60:4, (965-980), Online publication date: 1-Jul-2012.
- Coffman E, Robert P, Simatos F, Tarumi S and Zussman G (2012). A performance analysis of channel fragmentation in dynamic spectrum access systems, Queueing Systems: Theory and Applications, 71:3, (293-320), Online publication date: 1-Jul-2012.
- Kozlov D (2012). Some Conjectures Concerning Complexity of PL subdivisions, Electronic Notes in Theoretical Computer Science (ENTCS), 283:C, (153-157), Online publication date: 15-Jun-2012.
- Fekete S, Kamphans T, Schweer N, Tessars C, van der Veen J, Angermeier J, Koch D and Teich J (2012). Dynamic Defragmentation of Reconfigurable Devices, ACM Transactions on Reconfigurable Technology and Systems, 5:2, (1-20), Online publication date: 1-Jun-2012.
- Stein B, Hoppe D and Gollub T The impact of spelling errors on patent search Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics, (570-579)
- Manley M and Kim Y (2012). Exitus, International Journal of Intelligent Information Technologies, 8:2, (1-13), Online publication date: 1-Apr-2012.
- Knopfmacher A and Mansour T (2012). Record statistics in a random composition, Discrete Applied Mathematics, 160:4, (593-603), Online publication date: 1-Mar-2012.
- LaForest C and Steffan J OCTAVO Proceedings of the ACM/SIGDA international symposium on Field Programmable Gate Arrays, (219-228)
- Burton S, Morris R, Dimond M, Hansen J, Giraud-Carrier C, West J, Hanson C and Barnes M Public health community mining in YouTube Proceedings of the 2nd ACM SIGHIT International Health Informatics Symposium, (81-90)
- Claret G, Mathieu M, Naccache D and Seguin G Physical simulation of inarticulate robots Cryptography and Security, (491-499)
- Cukier D and Yoder J The artist in the computer scientist Proceedings of the 10th SIGPLAN symposium on New ideas, new paradigms, and reflections on programming and software, (129-136)
- Cichon J, Kapelko R and Marchwicki K Brief announcement Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems, (439-440)
- Chvátal V, Rautenbach D and Schäfer P (2011). Finite Sholander trees, trees, and their betweenness, Discrete Mathematics, 311:20, (2143-2147), Online publication date: 1-Oct-2011.
- Cherlin G (2011). Forbidden substructures and combinatorial dichotomies, Discrete Mathematics, 311:15, (1543-1584), Online publication date: 1-Aug-2011.
- Bottoni P, Cordasco G, De Chiara R, Fish A and Scarano V Personalised resource categorisation using euler diagrams Proceedings of the Third international conference on End-user development, (251-257)
- Ruskey F Teaching the art of computer programming (TAOCP) Proceedings of the 16th Western Canadian Conference on Computing Education, (2-6)
- Berger A, Röglin H and Van Der Zwaan R Path trading Proceedings of the 10th international conference on Experimental algorithms, (43-53)
- Fernández del Pozo J and Bielza C (2011). Dealing with complex queries in decision-support systems, Data & Knowledge Engineering, 70:2, (167-181), Online publication date: 1-Feb-2011.
- Loew J, Elwell J, Ponomarev D and Madden P Mathematical limits of parallel computation for embedded systems Proceedings of the 16th Asia and South Pacific Design Automation Conference, (653-660)
- Löffler M and Mulzer W Triangulating the square and squaring the triangle Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, (1759-1777)
- Coffman E Computer storage fragmentation Dependable and Historic Computing, (174-184)
- Manca V A recurrent enumeration of free hypermultisets Computation, cooperation, and life, (16-23)
- Yu Z, Cai D and He X Error-correcting output hashing in fast similarity search Proceedings of the Second International Conference on Internet Multimedia Computing and Service, (7-10)
- Webber W, Moffat A and Zobel J (2010). A similarity measure for indefinite rankings, ACM Transactions on Information Systems, 28:4, (1-38), Online publication date: 1-Nov-2010.
- Yang H, Schenk T, Bergmans J and Pandharipande A (2010). Enhanced illumination sensing using multiple harmonics for LED lighting systems, IEEE Transactions on Signal Processing, 58:11, (5508-5522), Online publication date: 1-Nov-2010.
- Grigorieva E, Herings P, Müller R and Vermeulen D (2010). On the Fastest Vickrey Algorithm, Algorithmica, 58:3, (566-590), Online publication date: 1-Nov-2010.
- Palem K Compilers, architectures and synthesis for embedded computing Proceedings of the 2010 international conference on Compilers, architectures and synthesis for embedded systems, (167-176)
- Chung F, Claesson A, Dukes M and Graham R (2010). Descent polynomials for permutations with bounded drop size, European Journal of Combinatorics, 31:7, (1853-1867), Online publication date: 1-Oct-2010.
- Bifet A Adaptive Stream Mining Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams, (1-212)
- Zhang D, Wang J, Cai D and Lu J Self-taught hashing for fast similarity search Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval, (18-25)
- Rabinovich E, Etzion O, Ruah S and Archushin S Analyzing the behavior of event processing applications Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems, (223-234)
- Hawick K and James H (2010). Small-world effects in wireless agent sensor networks, International Journal of Wireless and Mobile Computing, 4:3, (155-164), Online publication date: 1-Jul-2010.
- Barnabei M, Bonetti F and Silimbani M (2010). The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2, European Journal of Combinatorics, 31:5, (1360-1371), Online publication date: 1-Jul-2010.
- Dukes M and Reifegerste A (2010). The area above the Dyck path of a permutation, Advances in Applied Mathematics, 45:1, (15-23), Online publication date: 1-Jul-2010.
- Bernstein D and Lange T Type-II optimal polynomial bases Proceedings of the Third international conference on Arithmetic of finite fields, (41-61)
- Wolfmaier K, Ramler R and Dobler H Issues in testing collection class libraries Proceedings of the 1st Workshop on Testing Object-Oriented Systems, (1-8)
- Coffman E, Robert P, Simatos F, Tarumi S and Zussman G Channel fragmentation in dynamic spectrum access systems Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (333-344)
- Coffman E, Robert P, Simatos F, Tarumi S and Zussman G (2010). Channel fragmentation in dynamic spectrum access systems, ACM SIGMETRICS Performance Evaluation Review, 38:1, (333-344), Online publication date: 12-Jun-2010.
- Wei F TEDI Proceedings of the 2010 ACM SIGMOD International Conference on Management of data, (99-110)
- Chuan W and Ho H (2010). Factors of characteristic words, Theoretical Computer Science, 411:31-33, (2827-2846), Online publication date: 1-Jun-2010.
- Bruun A, Edelkamp S, Katajainen J and Rasmussen J Policy-based benchmarking of weak heaps and their relatives, Proceedings of the 9th international conference on Experimental Algorithms, (424-435)
- Huber T (2010). Zeros of generalized Rogers-Ramanujan series, Journal of Approximation Theory, 162:5, (910-930), Online publication date: 1-May-2010.
- Yang L, Hou W, Cao L, Zhao B and Zheng H Supporting demanding wireless applications with frequency-agile radios Proceedings of the 7th USENIX conference on Networked systems design and implementation, (5-5)
- Finucane H and Mitzenmacher M (2010). An improved analysis of the lossy difference aggregator, ACM SIGCOMM Computer Communication Review, 40:2, (4-11), Online publication date: 9-Apr-2010.
- Sudan K, Chatterjee N, Nellans D, Awasthi M, Balasubramonian R and Davis A Micro-pages Proceedings of the fifteenth International Conference on Architectural support for programming languages and operating systems, (219-230)
- Warford J and Dimpfl C The pep/8 memory tracer Proceedings of the 41st ACM technical symposium on Computer science education, (371-375)
- Sudan K, Chatterjee N, Nellans D, Awasthi M, Balasubramonian R and Davis A (2010). Micro-pages, ACM SIGPLAN Notices, 45:3, (219-230), Online publication date: 5-Mar-2010.
- Sudan K, Chatterjee N, Nellans D, Awasthi M, Balasubramonian R and Davis A (2010). Micro-pages, ACM SIGARCH Computer Architecture News, 38:1, (219-230), Online publication date: 5-Mar-2010.
- Italiano G and Raman R Topics in data structures Algorithms and theory of computation handbook, (5-5)
- Reingold E Algorithm design and analysis techniques Algorithms and theory of computation handbook, (1-1)
- Jamieson C and Fair I (2010). Construction of constrained codes for state-independent decoding, IEEE Journal on Selected Areas in Communications, 28:2, (193-199), Online publication date: 1-Feb-2010.
- Ficko M, Brezovnik S, Klancnik S, Balic J, Brezocnik M and Pahole I (2010). Intelligent design of an unconstrained layout for a flexible manufacturing system, Neurocomputing, 73:4-6, (639-647), Online publication date: 1-Jan-2010.
- Mantoro T Metrics evaluation for context-aware computing Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia, (574-578)
- Duch A and Martínez C (2009). Updating relaxed K-d trees, ACM Transactions on Algorithms, 6:1, (1-24), Online publication date: 1-Dec-2009.
- Shimizu S, Rangaswami R, Duran-Limon H and Corona-Perez M (2009). Platform-independent modeling and prediction of application resource usage characteristics, Journal of Systems and Software, 82:12, (2117-2127), Online publication date: 1-Dec-2009.
- Preoteasa V and Back R (2009). Data Refinement of Invariant Based Programs, Electronic Notes in Theoretical Computer Science (ENTCS), 259, (143-163), Online publication date: 1-Dec-2009.
- Meyers A, Cole M, Korth E and Pluta S Musicomputation Proceedings of the seventh ACM conference on Creativity and cognition, (29-38)
- Brodt S, Bry F and Eisinger N Search for More Declarativity Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems, (71-86)
- Maletti A and Satta G Parsing algorithms based on tree automata Proceedings of the 11th International Conference on Parsing Technologies, (1-12)
- Ferro N and Silvello G The NESTOR framework Proceedings of the 13th European conference on Research and advanced technology for digital libraries, (215-226)
- Meng D, Poslad S and Wang Y An intelligent context-aware spatial routing system in mobile environment Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing, (5461-5464)
- Zou F, Jiang X, Wang T and Lin Z A banyan-tree topology for railway wireless mesh network Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing, (2672-2675)
- Agosti M, Ferro N and Silvello G Access and Exchange of Hierarchically Structured Resources on the Web with the NESTOR Framework Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01, (659-662)
- Diaconu A, Manea F and Tiseanu C Combinatorial queries and updates on partial words Proceedings of the 17th international conference on Fundamentals of computation theory, (96-108)
- Bender M, Fekete S, Kamphans T and Schweer N Maintaining arrays of contiguous objects Proceedings of the 17th international conference on Fundamentals of computation theory, (14-25)
- Dragojevic A, Ni Y and Adl-Tabatabai A Optimizing transactions for captured memory Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, (214-222)
- Yi K, Li F, Cormode G, Hadjieleftheriou M, Kollios G and Srivastava D (2009). Small synopses for group-by query verification on outsourced data streams, ACM Transactions on Database Systems, 34:3, (1-42), Online publication date: 1-Aug-2009.
- Muresan C Comparative methods for the polynomial isolation Proceedings of the WSEAES 13th international conference on Computers, (634-638)
- Gao S, Kihara T, Shimizu S, Arakawa Y, Yamanaka N and Watanabe A A novel traffic engineering method using on-chip diorama network on dynamically reconfigurable processor DAPDNA-2 Proceedings of the 15th international conference on High Performance Switching and Routing, (56-61)
- Jula A and Rauchwerger L Two memory allocators that use hints to improve locality Proceedings of the 2009 international symposium on Memory management, (109-118)
- Corliss M and Hendry R (2009). Larc, Journal of Computing Sciences in Colleges, 24:6, (15-20), Online publication date: 1-Jun-2009.
- Calvin J (2009). Simulation output analysis using integrated paths II, ACM Transactions on Modeling and Computer Simulation, 19:3, (1-28), Online publication date: 1-Jun-2009.
- Li Y, Protopopescu V, Arnold N, Zhang X and Gorin A (2009). Hybrid parallel tempering and simulated annealing method, Applied Mathematics and Computation, 212:1, (216-228), Online publication date: 1-Jun-2009.
- Blanchette J (2009). Proof Pearl, Journal of Automated Reasoning, 43:1, (1-18), Online publication date: 1-Jun-2009.
- Clarke J, Constantinides G and Cheung P (2009). Word-length selection for power minimization via nonlinear optimization, ACM Transactions on Design Automation of Electronic Systems, 14:3, (1-28), Online publication date: 1-May-2009.
- Kyasanur P and Vaidya N (2009). Capacity of multichannel wireless networks under the protocol model, IEEE/ACM Transactions on Networking, 17:2, (515-527), Online publication date: 1-Apr-2009.
- Alonso L and Reingold E (2009). Average-case analysis of some plurality algorithms, ACM Transactions on Algorithms, 5:2, (1-36), Online publication date: 1-Mar-2009.
- Claesson A, Kitaev S and Steingrímsson E (2009). Decompositions and statistics for β(1,0)-trees and nonseparable permutations, Advances in Applied Mathematics, 42:3, (313-328), Online publication date: 1-Mar-2009.
- Muresan C Cost reduction on roots pre-isolation Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases, (366-371)
- Tryfonopoulos C, Koubarakis M and Drougas Y (2009). Information filtering and query indexing for an information retrieval model, ACM Transactions on Information Systems, 27:2, (1-47), Online publication date: 1-Feb-2009.
- Mansour T and Song C (2009). Kernel method and system of functional equations, Journal of Computational and Applied Mathematics, 224:1, (133-139), Online publication date: 1-Feb-2009.
- Yu H and Gibbons P (2009). Optimal inter-object correlation when replicating for availability, Distributed Computing, 21:5, (367-384), Online publication date: 1-Feb-2009.
- Vassilevska V (2009). Efficient algorithms for clique problems, Information Processing Letters, 109:4, (254-257), Online publication date: 15-Jan-2009.
- Manca V Enumerating Membrane Structures Membrane Computing, (292-298)
- Belazzougui D, Boldi P, Pagh R and Vigna S Monotone minimal perfect hashing Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, (785-794)
- Laube U and Nebel M Maximum likelihood analysis of heapsort Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, (41-50)
- Bonato A and Chiniforooshan E Pursuit and evasion from a distance Proceedings of the Meeting on Analytic Algorithmics and Combinatorics, (1-10)
- Meng D and Poslad S A reflective context-aware system for spatial routing applications Proceedings of the 6th international workshop on Middleware for pervasive and ad-hoc computing, (54-59)
- Mareš M (2008). Research paper, Computer Science Review, 2:3, (165-221), Online publication date: 1-Dec-2008.
- Artail H, Amine H and Sakkal F (2008). SQL query space and time complexity estimation for multidimensional queries, International Journal of Intelligent Information and Database Systems, 2:4, (460-480), Online publication date: 1-Nov-2008.
- Herlihy M, Shavit N and Tzafrir M Hopscotch Hashing Proceedings of the 22nd international symposium on Distributed Computing, (350-364)
- Choros K and Kaczynski K (2008). Time and quality of 3D rendering process using programming code optimisation techniques, International Journal of Intelligent Information and Database Systems, 2:3, (309-319), Online publication date: 1-Sep-2008.
- Liu D, Huang D, Luo P and Dai Y (2008). New schemes for sharing points on an elliptic curve, Computers & Mathematics with Applications, 56:6, (1556-1561), Online publication date: 1-Sep-2008.
- Haeupler B, Kavitha T, Mathew R, Sen S and Tarjan R Faster Algorithms for Incremental Topological Ordering Proceedings of the 35th international colloquium on Automata, Languages and Programming - Volume Part I, (421-433)
- Farzan A and Munro J A Uniform Approach Towards Succinct Representation of Trees Proceedings of the 11th Scandinavian workshop on Algorithm Theory, (173-184)
- Andersson D, Hansen K, Miltersen P and Sørensen T Deterministic Graphical Games Revisited Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms, (1-10)
- Heinis T and Alonso G Efficient lineage tracking for scientific workflows Proceedings of the 2008 ACM SIGMOD international conference on Management of data, (1007-1018)
- McIlroy R, Dickman P and Sventek J Efficient dynamic heap allocation of scratch-pad memory Proceedings of the 7th international symposium on Memory management, (31-40)
- Biggar P, Nash N, Williams K and Gregg D (2008). An experimental study of sorting and branch prediction, ACM Journal of Experimental Algorithmics, 12, (1-39), Online publication date: 1-Jun-2008.
- Baccelli F and McDonald D (2008). A stochastic model for the throughput of non-persistent TCP flows, Performance Evaluation, 65:6-7, (512-530), Online publication date: 1-Jun-2008.
- Balcan M, Blum A and Vempala S A discriminative framework for clustering via similarity functions Proceedings of the fortieth annual ACM symposium on Theory of computing, (671-680)
- Liu S and Karimi H (2008). Grid query optimizer to improve query processing in grids, Future Generation Computer Systems, 24:5, (342-353), Online publication date: 1-May-2008.
- Nicol D (2008). Efficient simulation of Internet worms, ACM Transactions on Modeling and Computer Simulation, 18:2, (1-32), Online publication date: 1-Apr-2008.
- Maurer W (2008). Survey, Computer Science Review, 2:1, (1-28), Online publication date: 1-Apr-2008.
- Cecil T, Osher S and Qian J (2008). Essentially Non-Oscillatory Adaptive Tree Methods, Journal of Scientific Computing, 35:1, (25-41), Online publication date: 1-Apr-2008.
- Kaplan H and Tarjan R (2008). Thin heaps, thick heaps, ACM Transactions on Algorithms, 4:1, (1-14), Online publication date: 1-Mar-2008.
- Goldin D and Wegner P (2008). The Interactive Nature of Computing, Minds and Machines, 18:1, (17-38), Online publication date: 1-Mar-2008.
- Choi Y and Han H (2008). Shared heap management for memory-limited java virtual machines, ACM Transactions on Embedded Computing Systems, 7:2, (1-32), Online publication date: 1-Feb-2008.
- Brändén P (2008). Actions on permutations and unimodality of descent polynomials, European Journal of Combinatorics, 29:2, (514-531), Online publication date: 1-Feb-2008.
- Czyzowicz J, Dobrev S, Kranakis E and Krizanc D The power of tokens Proceedings of the 34th conference on Current trends in theory and practice of computer science, (234-246)
- Boker U and Dershowitz N The church-turing thesis over arbitrary domains Pillars of computer science, (199-229)
- Vatter V (2008). Enumeration schemes for restricted permutations, Combinatorics, Probability and Computing, 17:1, (137-159), Online publication date: 1-Jan-2008.
- Bielza C, Fernández del Pozo J and Lucas P (2008). Explaining clinical decisions by extracting regularity patterns, Decision Support Systems, 44:2, (397-408), Online publication date: 1-Jan-2008.
- Moss A, Page D and Smart N Toward acceleration of RSA using 3D graphics hardware Proceedings of the 11th IMA international conference on Cryptography and coding, (364-383)
- Calvin J Low bias integrated path estimators Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come, (303-307)
- Gabel M and Haungs M CAMP Proceedings of the 21st conference on Large Installation System Administration Conference, (1-14)
- Janson S and Szpankowski W (2007). Partial fillup and search time in LC tries, ACM Transactions on Algorithms, 3:4, (44-es), Online publication date: 1-Nov-2007.
- Falley P (2007). Categories of data structures, Journal of Computing Sciences in Colleges, 23:1, (147-153), Online publication date: 1-Oct-2007.
- Collberg C, Thomborson C and Townsend G (2007). Dynamic graph-based software fingerprinting, ACM Transactions on Programming Languages and Systems, 29:6, (35-es), Online publication date: 1-Oct-2007.
- Helmer S Measuring the structural similarity of semistructured documents using entropy Proceedings of the 33rd international conference on Very large data bases, (1022-1032)
- Adamatzky A Encapsulating reaction-diffusion computers Proceedings of the 5th international conference on Machines, computations, and universality, (1-11)
- Sankaranarayanan S, Chang R, Jiang G and Ivančić F State space exploration using feedback constraint generation and Monte-Carlo sampling Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering, (321-330)
- Yu H and Gibbons P Optimal inter-object correlation when replicating for availability Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, (254-263)
- Danjean V, Gillard R, Guelton S, Roch J and Roche T Adaptive loops with kaapi on multicore and grid Proceedings of the 2007 international workshop on Parallel symbolic computation, (33-42)
- Kennedy A, Binoth T and Rippon T Automating renormalization of quantum field theories Proceedings of the 2007 international workshop on Symbolic-numeric computation, (18-27)
- Calvin J (2007). Simulation output analysis using integrated paths, ACM Transactions on Modeling and Computer Simulation, 17:3, (13-es), Online publication date: 1-Jul-2007.
- Eden A (2007). Three Paradigms of Computer Science, Minds and Machines, 17:2, (135-167), Online publication date: 1-Jul-2007.
- Yao Y The Art of Granular Computing Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms, (101-112)
- Senellart P and Abiteboul S On the complexity of managing probabilistic XML data Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (283-292)
- Chen X, Riesenfeld R and Cohen E Sliding windows algorithm for B-spline multiplication Proceedings of the 2007 ACM symposium on Solid and physical modeling, (265-276)
- Li W, Martin R and Langbein F Generating smooth parting lines for mold design for meshes Proceedings of the 2007 ACM symposium on Solid and physical modeling, (193-204)
- Liu J, Chen H, Ewing R and Qin G (2007). An efficient algorithm for characteristic tracking on two-dimensional triangular meshes, Computing, 80:2, (121-136), Online publication date: 1-Jun-2007.
- Smith C Introduction to software performance engineering Proceedings of the 7th international conference on Formal methods for performance evaluation, (395-428)
- Jiang L, Misherghi G, Su Z and Glondu S DECKARD Proceedings of the 29th international conference on Software Engineering, (96-105)
- Garay J, Schoenmakers B and Villegas J Practical and secure solutions for integer comparison Proceedings of the 10th international conference on Practice and theory in public-key cryptography, (330-342)
- Silverman R, Ackerman A and Chesley H (2007). A new simulator and ide for teaching CS220, Journal of Computing Sciences in Colleges, 22:4, (137-144), Online publication date: 1-Apr-2007.
- Helwig S and Wanka R Particle Swarm Optimization in High-Dimensional Bounded Search Spaces Proceedings of the 2007 IEEE Swarm Intelligence Symposium, (198-205)
- Berstel J and Perrin D (2007). The origins of combinatorics on words, European Journal of Combinatorics, 28:3, (996-1022), Online publication date: 1-Apr-2007.
- Scholz B and Blieberger J A new elimination-based data flow analysis framework using annotated decomposition trees Proceedings of the 16th international conference on Compiler construction, (202-217)
- Min H, Yi S, Cho Y and Hong J An efficient dynamic memory allocator for sensor operating systems Proceedings of the 2007 ACM symposium on Applied computing, (1159-1164)
- Warford J and Okelberry R (2007). Pep8CPU, ACM SIGCSE Bulletin, 39:1, (288-292), Online publication date: 7-Mar-2007.
- Warford J and Okelberry R Pep8CPU Proceedings of the 38th SIGCSE technical symposium on Computer science education, (288-292)
- Pareja-Flores C, Urquiza-Fuentes J and Velázquez-Iturbide J (2007). WinHIPE, ACM SIGPLAN Notices, 42:3, (14-23), Online publication date: 1-Mar-2007.
- Pandey M, Delorey D, Qiuyi Duan , Lei Wang , Knutson C, Zappala D and Woodings R RIA Proceedings of the 2007 IEEE Wireless Communications and Networking Conference, (4051-4056)
- Skarbek W (2007). On Generating All Binary Trees, Fundamenta Informaticae, 75:1-4, (505-536), Online publication date: 1-Jan-2007.
- Janson S (2006). Left and Right Pathlengths in Random Binary Trees, Algorithmica, 46:3-4, (419-429), Online publication date: 1-Nov-2006.
- Becker S, Hasselbring W, Paul A, Boskovic M, Koziolek H, Ploski J, Dhama A, Lipskoch H, Rohr M, Winteler D, Giesecke S, Meyer R, Swaminathan M, Happe J, Muhle M and Warns T (2006). Trustworthy software systems, ACM SIGSOFT Software Engineering Notes, 31:6, (1-18), Online publication date: 1-Nov-2006.
- Dunkels A, Schmidt O, Voigt T and Ali M Protothreads Proceedings of the 4th international conference on Embedded networked sensor systems, (29-42)
- Carter S, Hurst A, Mankoff J and Li J Dynamically adapting GUIs to diverse input devices Proceedings of the 8th international ACM SIGACCESS conference on Computers and accessibility, (63-70)
- Masmano M, Ripoll I and Crespo A A comparison of memory allocators for real-time applications Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems, (68-76)
- Ross K Towards an automatic complexity analysis for generic programs Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming, (87-95)
- Puhlmann F and Weske M Investigations on soundness regarding lazy activities Proceedings of the 4th international conference on Business Process Management, (145-160)
- Bousquet-Mélou M and Jehanne A (2006). Polynomial equations with one catalytic variable, algebraic series and map enumeration, Journal of Combinatorial Theory Series B, 96:5, (623-672), Online publication date: 1-Sep-2006.
- Kaiser C, Pradat-Peyre J, Évangelista S and Rousseau P (2006). Comparing Java, C# and Ada monitors queuing policies, ACM SIGAda Ada Letters, XXVI:2, (23-37), Online publication date: 1-Aug-2006.
- Bader R (2006). Dynamic polymorphism in Fortran 95, ACM SIGPLAN Fortran Forum, 25:2, (3-7), Online publication date: 1-Aug-2006.
- Cichoń J, Kutyłowski M and Zawada M Adaptive initialization algorithm for ad hoc radio networks with carrier sensing Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks, (35-46)
- Kauers M and Schneider C Application of unspecified sequences in symbolic summation Proceedings of the 2006 international symposium on Symbolic and algebraic computation, (177-183)
- Backhouse R and Michaelis D Exercises in quantifier manipulation Proceedings of the 8th international conference on Mathematics of Program Construction, (69-81)
- Cheadle A, Field A, Ayres J, Dunn N, Hayden R and Nystrom-Persson J Visualising dynamic memory allocators Proceedings of the 5th international symposium on Memory management, (115-125)
- Dolev D, Mokryn O and Shavitt Y (2006). On multicast trees, IEEE/ACM Transactions on Networking, 14:3, (557-567), Online publication date: 1-Jun-2006.
- Weihrauch C, Dimov I, Branford S and Alexandrov V Comparison of the computational cost of a monte carlo and deterministic algorithm for computing bilinear forms of matrix powers Proceedings of the 6th international conference on Computational Science - Volume Part III, (640-647)
- Grigorieff S (2006). Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D⌊logD⌋, Theoretical Computer Science, 356:1, (170-185), Online publication date: 5-May-2006.
- Cecil T, Osher S and Qian J (2006). Simplex free adaptive tree fast sweeping and evolution methods for solving level set equations in arbitrary dimension, Journal of Computational Physics, 213:2, (458-473), Online publication date: 10-Apr-2006.
- Poblete P, Munro J and Papadakis T (2006). The binomial transform and the analysis of skip lists, Theoretical Computer Science, 352:1, (136-158), Online publication date: 7-Mar-2006.
- Kenthapadi K and Panigrahy R Balanced allocation on graphs Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, (434-443)
- Christodoulakis M, Iliopoulos C and Ardila Y Simple algorithm for sorting the fibonacci string rotations Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science, (218-225)
- Kobayashi K, Morita H and Hoshi M Percolation on a k-ary tree General Theory of Information Transfer and Combinatorics, (633-638)
- Flajolet P, Szpankowski W and Vallée B (2006). Hidden word statistics, Journal of the ACM, 53:1, (147-183), Online publication date: 1-Jan-2006.
- López-Ortiz A, Mirzazadeh M, Safari M and Sheikhattar H (2005). Fast string sorting using order-preserving compression, ACM Journal of Experimental Algorithmics, 10, (1.4-es), Online publication date: 31-Dec-2005.
- Chuan W and Ho H (2005). Locating factors of the infinite Fibonacci word, Theoretical Computer Science, 349:3, (429-442), Online publication date: 16-Dec-2005.
- Cruz-Cortés N, Rodríguez-Henríquez F, Juárez-Morales R and Coello Coello C Finding optimal addition chains using a genetic algorithm approach Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I, (208-215)
- Wegner P, Arbab F, Goldin D, McBurney P, Luck M and Robertson D (2005). The Role of Agent Interaction in Models of Computing, Electronic Notes in Theoretical Computer Science (ENTCS), 141:5, (181-198), Online publication date: 1-Dec-2005.
- Kiwiel K (2005). On Floyd and Rivest's SELECT algorithm, Theoretical Computer Science, 347:1-2, (214-238), Online publication date: 30-Nov-2005.
- Valiente G A fast algorithmic technique for comparing large phylogenetic trees Proceedings of the 12th international conference on String Processing and Information Retrieval, (370-375)
- Kuliamin V (2005). Test Sequence Construction Using Minimum Information on the Tested System, Programming and Computing Software, 31:6, (301-309), Online publication date: 1-Nov-2005.
- Viola A (2005). Exact distribution of individual displacements in linear probing hashing, ACM Transactions on Algorithms, 1:2, (214-242), Online publication date: 1-Oct-2005.
- Ryabko B, Monarev V and Shokin Y (2005). A New Type of Attacks on Block Ciphers, Problems of Information Transmission, 41:4, (385-394), Online publication date: 1-Oct-2005.
- Bilotta E and Pantano P (2005). Emergent Patterning Phenomena in 2D Cellular Automata, Artificial Life, 11:3, (339-362), Online publication date: 1-Sep-2005.
- Joye M, Paillier P and Schoenmakers B On second-order differential power analysis Proceedings of the 7th international conference on Cryptographic hardware and embedded systems, (293-308)
- Monasson R A generating function method for the average-case analysis of DPLL Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques, (402-413)
- Keil D and Goldin D Indirect interaction in environments for multi-agent systems Proceedings of the 2nd international conference on Environments for Multi-Agent Systems, (68-87)
- Chase D and Lev Y Dynamic circular work-stealing deque Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, (21-28)
- Defoe D, Cholleti S and Cytron R (2005). Upper bound for defragmenting buddy heaps, ACM SIGPLAN Notices, 40:7, (222-229), Online publication date: 12-Jul-2005.
- Defoe D, Cholleti S and Cytron R Upper bound for defragmenting buddy heaps Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems, (222-229)
- Yang R, Kalnis P and Tung A Similarity evaluation on tree-structured data Proceedings of the 2005 ACM SIGMOD international conference on Management of data, (754-765)
- Fritz C and Wilke T (2005). Simulation relations for alternating Büchi automata, Theoretical Computer Science, 338:1-3, (275-314), Online publication date: 10-Jun-2005.
- Bille P (2005). A survey on tree edit distance and related problems, Theoretical Computer Science, 337:1-3, (217-239), Online publication date: 9-Jun-2005.
- Goldin D and Wegner P The church-turing thesis Proceedings of the First international conference on Computability in Europe: new Computational Paradigms, (152-168)
- Xing C and Buckles B (2005). On the size of the search space of join optimization, Journal of Computing Sciences in Colleges, 20:6, (136-142), Online publication date: 1-Jun-2005.
- Sze S, Lu Y and Yang Q A polynomial time solvable formulation of multiple sequence alignment Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology, (204-216)
- Castro J, Sierra J, Seznec A, Izquierdo A and Ribagorda A (2005). The strict avalanche criterion randomness test, Mathematics and Computers in Simulation, 68:1, (1-7), Online publication date: 3-Feb-2005.
- Aronov B, Asano T, Kikuchi Y, Nandy S, Sasahara S and Uno T A Generalization of Magic Squares with Applications to Digital Halftoning Algorithms and Computation, (89-100)
- Yi X (2004). Authenticated key agreement in dynamic peer groups, Theoretical Computer Science, 326:1-3, (363-382), Online publication date: 20-Oct-2004.
- Fill J and Kapur N (2004). Limiting distributions for additive functionals on Catalan trees, Theoretical Computer Science, 326:1-3, (69-102), Online publication date: 20-Oct-2004.
- Bacon D, Cheng P and Grove D Garbage collection for embedded systems Proceedings of the 4th ACM international conference on Embedded software, (125-136)
- Forth S, Tadjouddine M, Pryce J and Reid J (2004). Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding, ACM Transactions on Mathematical Software, 30:3, (266-299), Online publication date: 1-Sep-2004.
- Allen E (2004). Descent Monomials, P-Partitions and Dense Garsia-Haiman Modules, Journal of Algebraic Combinatorics: An International Journal, 20:2, (173-193), Online publication date: 1-Sep-2004.
- Ostromoukhov V, Donohue C and Jodoin P Fast hierarchical importance sampling with blue noise properties ACM SIGGRAPH 2004 Papers, (488-495)
- Ostromoukhov V, Donohue C and Jodoin P (2004). Fast hierarchical importance sampling with blue noise properties, ACM Transactions on Graphics, 23:3, (488-495), Online publication date: 1-Aug-2004.
- Özcan F, Subrahmanian V and Dix J (2004). Improving Performance of Heterogeneous Agents, Annals of Mathematics and Artificial Intelligence, 41:2-4, (339-395), Online publication date: 1-Aug-2004.
- Oliveira J, Yu S and Georganas N (2004). Synchronized World Embedding in Virtual Environments, IEEE Computer Graphics and Applications, 24:4, (73-83), Online publication date: 1-Jul-2004.
- Doherty S, Detlefs D, Groves L, Flood C, Luchangco V, Martin P, Moir M, Shavit N and Steele G DCAS is not a silver bullet for nonblocking algorithm design Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, (216-224)
- Leppänen V and Penttonen M Recurrence equation as basis for designing hot-potato routing protocols Proceedings of the 5th international conference on Computer systems and technologies, (1-6)
- Cocco S and Monasson R (2004). Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances, Theoretical Computer Science, 320:2-3, (345-372), Online publication date: 14-Jun-2004.
- Sun N, Nakamura R, Zhu H, Tada A and Sun W An analysis of average search cost of the external hashing with separate chain Proceedings of the 5th WSEAS International Conference on Applied Mathematics, (1-6)
- Kessler P (2004). Fast breakpoints, ACM SIGPLAN Notices, 39:4, (390-397), Online publication date: 1-Apr-2004.
- Steele G and White J (2004). How to print floating-point numbers accurately, ACM SIGPLAN Notices, 39:4, (372-389), Online publication date: 1-Apr-2004.
- Allen R and Kennedy K (2004). Automatic loop interchange, ACM SIGPLAN Notices, 39:4, (75-90), Online publication date: 1-Apr-2004.
- Nekrasov S (2004). Probability-Theoretic and Statistical Analysis of Dictionary Texts, Problems of Information Transmission, 40:2, (168-174), Online publication date: 1-Apr-2004.
- Zhang N, Kacholia V and Özsu M A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML Proceedings of the 20th International Conference on Data Engineering
- Chen Y A new algorithm for computing transitive closures Proceedings of the 2004 ACM symposium on Applied computing, (1091-1092)
- Zhang N XML query processing and optimization Proceedings of the 2004 international conference on Current Trends in Database Technology, (121-132)
- Roussos C Teaching growth of functions using equivalence classes Proceedings of the 35th SIGCSE technical symposium on Computer science education, (170-174)
- Roussos C (2004). Teaching growth of functions using equivalence classes, ACM SIGCSE Bulletin, 36:1, (170-174), Online publication date: 1-Mar-2004.
- Johnson L (2004). Tumble, a fast simple iteration algorithm for Fibonacci, Information Processing Letters, 89:4, (187-189), Online publication date: 28-Feb-2004.
- Bohan Broderick P (2004). On Communication and Computation, Minds and Machines, 14:1, (1-19), Online publication date: 1-Feb-2004.
- Aksenova E, Lazutina A and Sokolov A (2004). Study of a Non-Markovian Stack Management Model in a Two-Level Memory, Programming and Computing Software, 30:1, (25-33), Online publication date: 1-Jan-2004.
- Creak A (2003). Programming lessons from days gone by, ACM SIGPLAN Notices, 38:12, (11-16), Online publication date: 1-Dec-2003.
- Devroye L and Neininger R (2003). Random suffix search trees, Random Structures & Algorithms, 23:4, (357-396), Online publication date: 1-Dec-2003.
- Gerbessiotis A and Siniolakis C (2003). Randomized selection in n + C + o(n) comparisons, Information Processing Letters, 88:3, (95-100), Online publication date: 15-Nov-2003.
- Frens J and Wise D (2003). QR factorization with Morton-ordered quadtree matrices for memory re-use and parallelism, ACM SIGPLAN Notices, 38:10, (144-154), Online publication date: 1-Oct-2003.
- Dobra A, Karr A and Sanil A (2003). Preserving confidentiality of high-dimensional tabulated data, Statistics and Computing, 13:4, (363-370), Online publication date: 1-Oct-2003.
- Intrigila B and Nesi M (2003). On structural properties of eta-expansions of identity, Information Processing Letters, 87:6, (327-333), Online publication date: 30-Sep-2003.
- Bird R and Hinze R Functional Pearl trouble shared is trouble halved Proceedings of the 2003 ACM SIGPLAN workshop on Haskell, (1-6)
- Daida J, Hilss A, Ward D and Long S Visualizing tree structures in genetic programming Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII, (1652-1664)
- Daida J and Hilss A Identifying structural mechanisms in standard genetic programming Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII, (1639-1651)
- Zens R and Ney H A comparative study on reordering constraints in statistical machine translation Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1, (144-151)
- Menascé D (2003). Scaling Web Sites Through Caching, IEEE Internet Computing, 7:4, (86-89), Online publication date: 1-Jul-2003.
- Valiente G Constrained tree inclusion Proceedings of the 14th annual conference on Combinatorial pattern matching, (361-371)
- Frens J and Wise D QR factorization with Morton-ordered quadtree matrices for memory re-use and parallelism Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming, (144-154)
- Garofalakis M and Kumar A Correlating XML data streams using tree-edit distance embeddings Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (143-154)
- Knüpfer A A new data compression technique for event based program traces Proceedings of the 2003 international conference on Computational science: PartIII, (956-965)
- Herlihy M, Luchangco V and Moir M Obstruction-Free Synchronization Proceedings of the 23rd International Conference on Distributed Computing Systems
- Wang H and Pieprzyk J Shared generation of pseudo-random functions with cumulative maps Proceedings of the 2003 RSA conference on The cryptographers' track, (281-295)
- Diwekar U (2003). A Novel Sampling Approach to Combinatorial Optimization Under Uncertainty, Computational Optimization and Applications, 24:2-3, (335-371), Online publication date: 1-Feb-2003.
- Chen W and Hwang H (2003). Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model, Journal of Algorithms, 46:2, (140-177), Online publication date: 1-Feb-2003.
- Blelloch G, Maggs B and Woo S Space-efficient finger search on degree-balanced search trees Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (374-383)
- Szwarcfiter J, Navarro G, Baeza-Yates R, Oliveira J, Cunto W and Ziviani N (2003). Optimal binary search trees with costs depending on the access paths, Theoretical Computer Science, 290:3, (1799-1814), Online publication date: 3-Jan-2003.
- Grabmeier J, Kaltofen E and Weispfenning V Cited References Computer algebra handbook, (493-622)
- Fekete A Using counter-examples in the data structures course Proceedings of the fifth Australasian conference on Computing education - Volume 20, (179-186)
- Newell A and Simon H Symbol manipulation Encyclopedia of Computer Science, (1731-1735)
- Wegner P and Hemmendinger D Stack Encyclopedia of Computer Science, (1674-1675)
- Wegner P Program Encyclopedia of Computer Science, (1452-1453)
- Atkinson M and Printezis T Memory management Encyclopedia of Computer Science, (1146-1152)
- Wegner P and Reilly E Data structures Encyclopedia of Computer Science, (507-512)
- Liu C and Reingold E Combinatorics Encyclopedia of Computer Science, (235-240)
- Herman G Algorithms, theory of Encyclopedia of Computer Science, (51-53)
- Paule P Algorithmic problem solving Encyclopedia of Computer Science, (38-40)
- Gupta S and Srimani P (2003). Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks, IEEE Transactions on Parallel and Distributed Systems, 14:1, (27-38), Online publication date: 1-Jan-2003.
- Chen M, Wu K and Yu P (2003). Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing, IEEE Transactions on Knowledge and Data Engineering, 15:1, (161-173), Online publication date: 1-Jan-2003.
- Atkinson M and Stitt T (2002). Restricted permutations and the wreath product, Discrete Mathematics, 259:1-3, (19-36), Online publication date: 28-Dec-2002.
- Bilotta E, Lafusa A and Pantano P Is self-replication an embedded characteristic of artificial/living matter? Proceedings of the eighth international conference on Artificial life, (38-48)
- Crank K and Fill J (2002). Interruptible Exact Sampling in the Passive Case, Methodology and Computing in Applied Probability, 4:4, (359-376), Online publication date: 1-Dec-2002.
- Coulson G, Baichoo S and Moonian O (2002). A retrospective on the design of the GOPI middleware platform, Multimedia Systems, 8:5, (340-352), Online publication date: 1-Dec-2002.
- Arya S (2002). Binary space partitions for axis-paralles line segments, Information Processing Letters, 84:4, (201-206), Online publication date: 30-Nov-2002.
- Balasa F, Maruvada S and Krishnamoorthy K Efficient solution space exploration based on segment trees in analog placement with symmetry constraints Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design, (497-502)
- Reznik Y (2002). Some results on tries with adaptive branching, Theoretical Computer Science, 289:2, (1009-1026), Online publication date: 30-Oct-2002.
- Kalikow L (2002). Symmetries in trees and parking functions, Discrete Mathematics, 256:3, (719-741), Online publication date: 28-Oct-2002.
- Bunting R, Lewis G, Long F, Seacord R and Wrage L Workshop on COTS Integration and Evaluation Proceedings of the 10th International Workshop on Software Technology and Engineering Practice
- Bookstein A, Kulyukin V and Raita T (2002). Generalized Hamming Distance, Information Retrieval, 5:4, (353-375), Online publication date: 1-Oct-2002.
- Mayhew G (2002). Extreme weight classes of de Bruijn sequences, Discrete Mathematics, 256:1-2, (495-497), Online publication date: 28-Sep-2002.
- Munarini E and Salvi N (2002). Structural and enumerative properties of the Fibonacci cubes, Discrete Mathematics, 255:1-3, (317-324), Online publication date: 28-Aug-2002.
- Fill J and Janson S (2002). Quicksort asymptotics, Journal of Algorithms, 44:1, (4-28), Online publication date: 1-Jul-2002.
- Sokolov A Optimization strategies of stack control Proceedings of the inaugural conference on the Principles and Practice of programming, 2002 and Proceedings of the second workshop on Intermediate representation engineering for virtual machines, 2002, (151-156)
- Chauve C (2002). Tree pattern matching with a more general notion of occurrence of the pattern, Information Processing Letters, 82:4, (197-201), Online publication date: 31-May-2002.
- Noble J (2002). The Full Monte, Computing in Science and Engineering, 4:3, (76-81), Online publication date: 1-May-2002.
- Panholzer A and Prodinger H (2002). Binary search tree recursions with harmonic toll functions, Journal of Computational and Applied Mathematics, 142:1, (211-225), Online publication date: 1-May-2002.
- Tadjouddine M, Forth S, Pryce J and Reid J Performance Issues for Vertex Elimination Methods in Computing Jacobians Using Automatic Differentiation Proceedings of the International Conference on Computational Science-Part II, (1077-1086)
- Pitman J (2002). Forest Volume Decompositions and Abel-Cayley-Hurwitz Multinomial Expansions, Journal of Combinatorial Theory Series A, 98:1, (175-191), Online publication date: 1-Apr-2002.
- Fekete A (2002). Teaching data structures with multiple collection class libraries, ACM SIGCSE Bulletin, 34:1, (396-400), Online publication date: 1-Mar-2002.
- Levitin A and Papalaskari M (2002). Using puzzles in teaching algorithms, ACM SIGCSE Bulletin, 34:1, (292-296), Online publication date: 1-Mar-2002.
- Gómez G and Liu Y (2002). Automatic time-bound analysis for a higher-order language, ACM SIGPLAN Notices, 37:3, (75-86), Online publication date: 1-Mar-2002.
- Fack V, Lievens S and Van der Jeugt J (2002). On the diameter of the rotation graph of binary coupling trees, Discrete Mathematics, 245:1, (1-18), Online publication date: 28-Feb-2002.
- Fekete A Teaching data structures with multiple collection class libraries Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (396-400)
- Levitin A and Papalaskari M Using puzzles in teaching algorithms Proceedings of the 33rd SIGCSE technical symposium on Computer science education, (292-296)
- Gómez G and Liu Y Automatic time-bound analysis for a higher-order language Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation, (75-86)
- Nebel M (2002). The stack-size of tries, Theoretical Computer Science, 270:1-2, (441-461), Online publication date: 6-Jan-2002.
- Butzer P Bernoulli functions, Hilbert-type poisson summation formulae, partial fraction expansions, and Hilbert-Eisenstein series Analysis, combinatorics and computing, (25-91)
- Caldwell C and Gallot Y (2002). On the primality of n! ± 1 and 2×3×5×...× p±1, Mathematics of Computation, 71:237, (441-448), Online publication date: 1-Jan-2002.
- Liu Y and Gómez G (2001). Automatic Accurate Cost-Bound Analysis for High-Level Languages, IEEE Transactions on Computers, 50:12, (1295-1309), Online publication date: 1-Dec-2001.
- Mao W (2001). Verifiable Partial Escrow of Integer Factors, Designs, Codes and Cryptography, 24:3, (327-342), Online publication date: 1-Dec-2001.
- Hinze R (2001). A simple implementation technique for priority search queues, ACM SIGPLAN Notices, 36:10, (110-121), Online publication date: 1-Oct-2001.
- Hinze R A simple implementation technique for priority search queues Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, (110-121)
- Lam K and Sica F (2001). The Weight Distribution of C_5(1, n), Designs, Codes and Cryptography, 24:2, (181-191), Online publication date: 1-Oct-2001.
- Biuk-Aghai R and Simoff S An integrative framework for knowledge extraction in collaborative virtual environments Proceedings of the 2001 ACM International Conference on Supporting Group Work, (61-70)
- Unnikrishnan L, Stoller S and Liu Y Automatic Accurate Live Memory Analysis for Garbage-Collected Languages Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems, (102-111)
- Unnikrishnan L, Stoller S and Liu Y Automatic Accurate Live Memory Analysis for Garbage-Collected Languages Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems, (102-111)
- Unnikrishnan L, Stoller S and Liu Y (2001). Automatic Accurate Live Memory Analysis for Garbage-Collected Languages, ACM SIGPLAN Notices, 36:8, (102-111), Online publication date: 1-Aug-2001.
- Detlefs D, Martin P, Moir M and Steele G Lock-free reference counting Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, (190-199)
- Wise D, Frens J, Gu Y and Alexander G (2001). Language support for Morton-order matrices, ACM SIGPLAN Notices, 36:7, (24-33), Online publication date: 1-Jul-2001.
- Sedjelmaci S On a parallel Lehmer-Euclid GCD algorithm Proceedings of the 2001 international symposium on Symbolic and algebraic computation, (303-308)
- Wise D, Frens J, Gu Y and Alexander G Language support for Morton-order matrices Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming, (24-33)
- Sitaraman M, Kulczycki G, Krone J, Ogden W and Reddy A Performance specification of software components Proceedings of the 2001 symposium on Software reusability: putting software reuse in context, (3-10)
- Sitaraman M, Kulczycki G, Krone J, Ogden W and Reddy A (2001). Performance specification of software components, ACM SIGSOFT Software Engineering Notes, 26:3, (3-10), Online publication date: 1-May-2001.
- Li X, Yang Y, Gouda M and Lam S Batch rekeying for secure group communications Proceedings of the 10th international conference on World Wide Web, (525-534)
- Frieze A and Halldórsson B Optimal sequencing by hybridization in rounds Proceedings of the fifth annual international conference on Computational biology, (141-148)
- Balasa F Device-level placement for analog layout Proceedings of the 2001 Asia and South Pacific Design Automation Conference, (281-286)
- Frabetti A (2001). Simplicial Properties of the Set of Planar Binary Trees, Journal of Algebraic Combinatorics: An International Journal, 13:1, (41-65), Online publication date: 1-Jan-2001.
- Draper D and Fouskakis D (2000). A Case Study of Stochastic Optimization in Health Policy, Journal of Global Optimization, 18:4, (399-416), Online publication date: 1-Dec-2000.
- Balasa F Modeling non-slicing floorplans with binary trees Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design, (13-16)
- Sikka S and Varghese G (2000). Memory-efficient state lookups with fast updates, ACM SIGCOMM Computer Communication Review, 30:4, (335-347), Online publication date: 1-Oct-2000.
- kutyłowski M, Loryś K, Oesterdiekhoff B and Wanka R (2000). Periodification scheme, Journal of the ACM, 47:5, (944-967), Online publication date: 1-Sep-2000.
- Valiant L (2000). A neuroidal architecture for cognitive computation, Journal of the ACM, 47:5, (854-882), Online publication date: 1-Sep-2000.
- Sikka S and Varghese G Memory-efficient state lookups with fast updates Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, (335-347)
- Agesen O, Detlefs D, Flood C, Garthwaite A, Martin P, Shavit N and Steele G DCAS-based concurrent deques Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, (137-146)
- Edahiro M, Matsushita S, Yamashina M and Nishi N (2000). A Single-Chip Multiprocessor for Smart Terminals, IEEE Micro, 20:4, (12-20), Online publication date: 1-Jul-2000.
- Seguel J, Bollman D and Feo J (2000). A Framework for the Design and Implementation of FFT Permutation Algorithms, IEEE Transactions on Parallel and Distributed Systems, 11:7, (625-635), Online publication date: 1-Jul-2000.
- Wetprasit R, Sattar A and Khatib L (2000). Representation and Reasoning with Multi-Point Events, Constraints, 5:3, (211-249), Online publication date: 1-Jul-2000.
- Ofelt D and Hennessy J Efficient performance prediction for modern microprocessors Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems, (229-239)
- Ofelt D and Hennessy J (2000). Efficient performance prediction for modern microprocessors, ACM SIGMETRICS Performance Evaluation Review, 28:1, (229-239), Online publication date: 1-Jun-2000.
- Peters S and Chesher A (2000). On the Use of Enumeration for Investigating the Performance of HypothesisTests for Economic Models with a Discrete Response Variable, Computational Economics, 15:3, (273-289), Online publication date: 1-Jun-2000.
- Reed B How tall is a tree? Proceedings of the thirty-second annual ACM symposium on Theory of computing, (479-483)
- Heinrich-Litan L and Molitor P (2000). Least Upper Bounds for the Size of OBDDs Using Symmetry Properties, IEEE Transactions on Computers, 49:4, (360-368), Online publication date: 1-Apr-2000.
- Golubchik L, Khanna S, Khuller S, Thurimella R and Zhu A Approximation algorithms for data placement on parallel disks Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (223-232)
- Adams A, Koopman J, Chick S and Yu P GERMS Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 2, (1549-1556)
- Wilson R and Bergeron R Dynamic Hierarchy Specification and Visualization Proceedings of the 1999 IEEE Symposium on Information Visualization
- Barve R and Vitter J A Theoretical Framework for Memory-Adaptive Algorithms Proceedings of the 40th Annual Symposium on Foundations of Computer Science
- Lee C (1999). Partial Evaluation of the Euclidean Algorithm, Revisited, Higher-Order and Symbolic Computation, 12:2, (203-212), Online publication date: 1-Sep-1999.
- Zheng S and Sun M (1999). Constructing Optimal Search Trees in Optimal Time, IEEE Transactions on Computers, 48:7, (738-743), Online publication date: 1-Jul-1999.
- Nester C, Philippsen M and Haumacher B A more efficient RMI for Java Proceedings of the ACM 1999 conference on Java Grande, (152-159)
- Huelsbergen L and Winterbottom P (1998). Very concurrent mark-&-sweep garbage collection without fine-grain synchronization, ACM SIGPLAN Notices, 34:3, (166-175), Online publication date: 1-Mar-1999.
- Roth D and Wise D (1998). One-bit counts between unique and sticky, ACM SIGPLAN Notices, 34:3, (49-56), Online publication date: 1-Mar-1999.
- Johnstone M and Wilson P (1998). The memory fragmentation problem, ACM SIGPLAN Notices, 34:3, (26-36), Online publication date: 1-Mar-1999.
- Hsieh S, Chen G and Ho C (1999). Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs, IEEE Transactions on Parallel and Distributed Systems, 10:3, (223-237), Online publication date: 1-Mar-1999.
- Yang Y and Wang J (1999). Wide-Sense Nonblocking Clos Networks Under Packing Strategy, IEEE Transactions on Computers, 48:3, (265-284), Online publication date: 1-Mar-1999.
- Lu C A deterministic approximation algorithm for a minmax integer programming problem Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (663-668)
- Coulson G (1999). A Configurable Multimedia Middleware Platform, IEEE MultiMedia, 6:1, (62-76), Online publication date: 1-Jan-1999.
- 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.
- Garland M and Heckbert P Simplifying surfaces with color and texture using quadric error metrics Proceedings of the conference on Visualization '98, (263-269)
- Huelsbergen L and Winterbottom P Very concurrent mark-&-sweep garbage collection without fine-grain synchronization Proceedings of the 1st international symposium on Memory management, (166-175)
- Roth D and Wise D One-bit counts between unique and sticky Proceedings of the 1st international symposium on Memory management, (49-56)
- Johnstone M and Wilson P The memory fragmentation problem Proceedings of the 1st international symposium on Memory management, (26-36)
- Kirrinnis P Fast numerical improvement of factors of polynomials and of partial fractions Proceedings of the 1998 international symposium on Symbolic and algebraic computation, (260-267)
- Coulson G and Clarke M (1998). A distributed object platform infrastructure for multimedia applications, Computer Communications, 21:9, (802-818), Online publication date: 1-Jul-1998.
- Larson P and Graefe G (1998). Memory management during run generation in external sorting, ACM SIGMOD Record, 27:2, (472-483), Online publication date: 1-Jun-1998.
- Cohen W (1998). Integration of heterogeneous databases without common domains using queries based on textual similarity, ACM SIGMOD Record, 27:2, (201-212), Online publication date: 1-Jun-1998.
- Larson P and Graefe G Memory management during run generation in external sorting Proceedings of the 1998 ACM SIGMOD international conference on Management of data, (472-483)
- Cohen W Integration of heterogeneous databases without common domains using queries based on textual similarity Proceedings of the 1998 ACM SIGMOD international conference on Management of data, (201-212)
- Khanna S and Zhou S On indexed data broadcast Proceedings of the thirtieth annual ACM symposium on Theory of computing, (463-472)
- Broder A, Charikar M, Frieze A and Mitzenmacher M Min-wise independent permutations (extended abstract) Proceedings of the thirtieth annual ACM symposium on Theory of computing, (327-336)
- Clinger W (1998). Proper tail recursion and space efficiency, ACM SIGPLAN Notices, 33:5, (174-185), Online publication date: 1-May-1998.
- Cheng P, Harper R and Lee P (1998). Generational stack collection and profile-driven pretenuring, ACM SIGPLAN Notices, 33:5, (162-173), Online publication date: 1-May-1998.
- Fähndrich M, Foster J, Su Z and Aiken A (1998). Partial online cycle elimination in inclusion constraint graphs, ACM SIGPLAN Notices, 33:5, (85-96), Online publication date: 1-May-1998.
- Clinger W Proper tail recursion and space efficiency Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, (174-185)
- Cheng P, Harper R and Lee P Generational stack collection and profile-driven pretenuring Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, (162-173)
- Fähndrich M, Foster J, Su Z and Aiken A Partial online cycle elimination in inclusion constraint graphs Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, (85-96)
- Neven F and Van den Bussche J Expressiveness of structured document query languages based on attribute grammars Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (11-17)
- 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.
- 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)
- Hayashi T, Nakano K and Olariu S (1998). Work-Time Optimal k-Merge Algorithms on the PRAM, IEEE Transactions on Parallel and Distributed Systems, 9:3, (275-282), Online publication date: 1-Mar-1998.
- de Azevedo M, Bagherzadeh N and Latifi S (1998). Low Expansion Packings and Embeddings of Hypercubes into Star Graphs, IEEE Transactions on Parallel and Distributed Systems, 9:3, (261-274), Online publication date: 1-Mar-1998.
- Bar-Noy A, Bhatia R, Naor J and Schieber B Minimizing service and operation costs of periodic scheduling Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (11-20)
- Dujardin E, Amiel E and Simon E (1998). Fast algorithms for compressed multimethod dispatch table generation, ACM Transactions on Programming Languages and Systems, 20:1, (116-165), Online publication date: 1-Jan-1998.
- Sagiv M, Reps T and Wilhelm R (1998). Solving shape-analysis problems in languages with destructive updating, ACM Transactions on Programming Languages and Systems, 20:1, (1-50), Online publication date: 1-Jan-1998.
- Frens J and Wise D (1997). Auto-blocking matrix-multiplication or tracking BLAS3 performance from source code, ACM SIGPLAN Notices, 32:7, (206-216), Online publication date: 1-Jul-1997.
- Wise D, Heck B, Hess C, Hunt W and Ost E (1997). Research Demonstration of a Hardware Reference-Counting Heap, Lisp and Symbolic Computation, 10:2, (159-181), Online publication date: 1-Jul-1997.
- Frens J and Wise D Auto-blocking matrix-multiplication or tracking BLAS3 performance from source code Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming, (206-216)
- Giloi W (1997). Konrad Zuse's Plankalkül, IEEE Annals of the History of Computing, 19:2, (17-24), Online publication date: 1-Apr-1997.
- Schmid U and Schossmaier K (1997). Interval-based Clock Synchronization, Real-Time Systems, 12:2, (173-228), Online publication date: 15-Feb-1997.
- Minato S Generation of BDDs from hardware algorithm descriptions Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, (644-649)
- Merchant A, Wu K, Yu P and Chen M (1996). Performance Analysis of Dynamic Finite Versioning Schemes, IEEE Transactions on Knowledge and Data Engineering, 8:6, (985-1001), Online publication date: 1-Dec-1996.
- Levin L (1996). Fundamentals of computing (a cheatlist), ACM SIGACT News, 27:3, (89), Online publication date: 1-Sep-1996.
- Maia M and Xavier Á (1996). A Semiautomatic Method for Assigning Elevation in Contour Maps, IEEE Transactions on Knowledge and Data Engineering, 8:4, (596-603), Online publication date: 1-Aug-1996.
- Wise D and Walgenbach J (1996). Static and dynamic partitioning of pointers as links and threads, ACM SIGPLAN Notices, 31:6, (42-49), Online publication date: 15-Jun-1996.
- Wise D and Walgenbach J Static and dynamic partitioning of pointers as links and threads Proceedings of the first ACM SIGPLAN international conference on Functional programming, (42-49)
- McAuliffe M, Carey M and Solomon M (1996). Towards effective and efficient free space management, ACM SIGMOD Record, 25:2, (389-400), Online publication date: 1-Jun-1996.
- McAuliffe M, Carey M and Solomon M Towards effective and efficient free space management Proceedings of the 1996 ACM SIGMOD international conference on Management of data, (389-400)
- Zaït M, Florescu D and Valduriez P (1996). Benchmarking the DBS3 Parallel Query Optimizer, IEEE Parallel & Distributed Technology: Systems & Technology, 4:2, (26-40), Online publication date: 1-Jun-1996.
- Peckham J, Maryanski F and Demurjian S (1996). Towards the Correctness and Consistency of Update Semantics in Semantic Database Schema, IEEE Transactions on Knowledge and Data Engineering, 8:3, (503-507), Online publication date: 1-Jun-1996.
- Peleg D and Wool A How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract) Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, (290-299)
- Akl S and Stojmenovic I (1996). Generating t-ary trees in parallel, Nordic Journal of Computing, 3:1, (63-71), Online publication date: 1-Mar-1996.
- Chang J and Gehringer E (1996). A High-Performance Memory Allocator for Object-Oriented Systems, IEEE Transactions on Computers, 45:3, (357-366), Online publication date: 1-Mar-1996.
- Aluru S Parallel additive lagged Fibonacci random number generators Proceedings of the 10th international conference on Supercomputing, (102-108)
- Nilsen K (1996). High-level dynamic memory management for object-oriented real-time systems, ACM SIGPLAN OOPS Messenger, 7:1, (86-93), Online publication date: 1-Jan-1996.
- Wen Z (1996). Multiway Merging in Parallel, IEEE Transactions on Parallel and Distributed Systems, 7:1, (11-17), Online publication date: 1-Jan-1996.
- Yu C and Chen G (1996). An Efficient Parallel Recognition Algorithm For Bipartite-Permutation Graphs, IEEE Transactions on Parallel and Distributed Systems, 7:1, (3-10), Online publication date: 1-Jan-1996.
- Peleg D and Wool A Crumbling walls Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, (120-129)
- Ciaccia P and Maio D (1995). Domains and Active Domains, IEEE Transactions on Knowledge and Data Engineering, 7:4, (641-655), Online publication date: 1-Aug-1995.
- Bookstein A, Klein S and Raita T Detecting content-bearing words by serial clustering—extended abstract Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval, (319-327)
- Ristad E and Thomas R New techniques for context modeling Proceedings of the 33rd annual meeting on Association for Computational Linguistics, (220-227)
- Ben-Amram A (1995). What is a “pointer machine”?, ACM SIGACT News, 26:2, (88-95), Online publication date: 1-Jun-1995.
- Subrahmanian V, Nau D and Vago C (1995). WFS + Branch and Bound = Stable Models, IEEE Transactions on Knowledge and Data Engineering, 7:3, (362-377), Online publication date: 1-Jun-1995.
- Kaplan H and Tarjan R Persistent lists with catenation via recursive slow-down Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (93-102)
- Majumdar A and Vrudhula S (1995). Fault Coverage and Test Length Estimation for Random Pattern Testing, IEEE Transactions on Computers, 44:2, (234-247), Online publication date: 1-Feb-1995.
- Fix J and Ladner R Optimal one-way sorting on a one-dimensional sub-bus array Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, (586-594)
- Talluri M and Hill M (1994). Surpassing the TLB performance of superpages with less operating system support, ACM SIGOPS Operating Systems Review, 28:5, (171-182), Online publication date: 1-Dec-1994.
- Talluri M and Hill M Surpassing the TLB performance of superpages with less operating system support Proceedings of the sixth international conference on Architectural support for programming languages and operating systems, (171-182)
- Talluri M and Hill M (1994). Surpassing the TLB performance of superpages with less operating system support, ACM SIGPLAN Notices, 29:11, (171-182), Online publication date: 1-Nov-1994.
- Latifi S (1994). Task Allocation in the Star Graph, IEEE Transactions on Parallel and Distributed Systems, 5:11, (1220-1224), Online publication date: 1-Nov-1994.
- Cohen R, Eades P, Lin T and Ruskey F Volume upper bounds for 3D graph drawing Proceedings of the 1994 conference of the Centre for Advanced Studies on Collaborative research
- Flajolet P, Zimmermann P and Van Cutsem B (1994). A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, 132:1, (1-35), Online publication date: 26-Sep-1994.
- Wu P and Wang F (1994). Pool, ACM SIGPLAN Notices, 29:9, (68-71), Online publication date: 1-Sep-1994.
- Wu P and Wang F (1994). Padded string, ACM SIGPLAN Notices, 29:9, (64-67), Online publication date: 1-Sep-1994.
- Kessler P (1994). A client-side stub interpreter, ACM SIGPLAN Notices, 29:8, (94-100), Online publication date: 1-Aug-1994.
- Kessler P A client-side stub interpreter Proceedings of the Workshop on Interface Definition Languages, (94-100)
- Davidson J and Jinturkar S Memory access coalescing Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, (186-195)
- Reistad B and Gifford D (1994). Static dependent costs for estimating execution time, ACM SIGPLAN Lisp Pointers, VII:3, (65-78), Online publication date: 1-Jul-1994.
- Reistad B and Gifford D Static dependent costs for estimating execution time Proceedings of the 1994 ACM conference on LISP and functional programming, (65-78)
- Davidson J and Jinturkar S (1994). Memory access coalescing, ACM SIGPLAN Notices, 29:6, (186-195), Online publication date: 1-Jun-1994.
- 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.
- Cai J and Paige R Towards increased productivity of algorithm implementation Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering, (71-78)
- Crawfis R, Max N, Becker B and Cabral B Volume rendering of 3D scalar and vector fields at LLNL Proceedings of the 1993 ACM/IEEE conference on Supercomputing, (570-576)
- Cai J and Paige R (1993). Towards increased productivity of algorithm implementation, ACM SIGSOFT Software Engineering Notes, 18:5, (71-78), Online publication date: 1-Dec-1993.
- Bieri H and Grimm F (1993). Approaching classical algorithms in APL2, ACM SIGAPL APL Quote Quad, 24:1, (33-40), Online publication date: 1-Sep-1993.
- Bieri H and Grimm F Approaching classical algorithms in APL2 Proceedings of the international conference on APL, (33-40)
- Calvo M and Sanz-Serna J (1993). High-Order Symplectic Runge–Kutta–Nyström Methods, SIAM Journal on Scientific Computing, 14:5, (1237-1252), Online publication date: 1-Sep-1993.
- Dybvig R, Bruggeman C and Eby D Guardians in a generation-based garbage collector Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, (207-216)
- Eppstein D, Miller G and Teng S A deterministic linear time algorithm for geometric separators and its applications Proceedings of the ninth annual symposium on Computational geometry, (99-108)
- Kilpeläinen P and Mannila H Retrieval from hierarchical texts by partial patterns Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval, (214-222)
- Bookstein A, Klein S and Raita T Is Huffman coding dead? (extended abstract) Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval, (80-87)
- Hatzivassiloglou V and McKeown K Towards the automatic identification of adjectival scales Proceedings of the 31st annual meeting on Association for Computational Linguistics, (172-182)
- Dybvig R, Bruggeman C and Eby D (1993). Guardians in a generation-based garbage collector, ACM SIGPLAN Notices, 28:6, (207-216), Online publication date: 1-Jun-1993.
- Huck J and Hays J Architectural support for translation table management in large address space machines Proceedings of the 20th annual international symposium on computer architecture, (39-50)
- Huck J and Hays J (1993). Architectural support for translation table management in large address space machines, ACM SIGARCH Computer Architecture News, 21:2, (39-50), Online publication date: 1-May-1993.
- Erdős P (1993). A new bijection on rooted forests, Discrete Mathematics, 111:1, (179-188), Online publication date: 22-Feb-1993.
- Klawe M and Mumey B Upper and lower bounds on constructing alphabetic binary trees Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (185-193)
- Buchsbaum A and Tarjan R Confluently persistent deques via data structuaral bootstrapping Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (155-164)
- Goldberg A and Hennessy J (1993). Mtool, IEEE Transactions on Parallel and Distributed Systems, 4:1, (28-40), Online publication date: 1-Jan-1993.
- Hsu W (1993). Fibonacci Cubes-A New Interconnection Topology, IEEE Transactions on Parallel and Distributed Systems, 4:1, (3-12), Online publication date: 1-Jan-1993.
- Thearling K and Smith S An improved supercomputer sorting benchmark Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (14-19)
- Morris R Process simulation Proceedings of the 24th conference on Winter simulation, (1249-1255)
- Gurd J and Snelling D Manchester data-flow Proceedings of the 6th international conference on Supercomputing, (216-225)
- Stokely E and Wu S (1992). Surface Parametrization and Curvature Measurement of Arbitrary 3-D Objects, IEEE Transactions on Pattern Analysis and Machine Intelligence, 14:8, (833-840), Online publication date: 1-Aug-1992.
- LaPaugh A, Lipton R and Sandberg J (1992). How to Store a Triangular Matrix, IEEE Transactions on Computers, 41:7, (896-899), Online publication date: 1-Jul-1992.
- Merchant A, Wu K, Yu P and Chen M (1992). Performance analysis of dynamic finite versioning for concurrent transaction and query processing, ACM SIGMETRICS Performance Evaluation Review, 20:1, (103-114), Online publication date: 1-Jun-1992.
- Merchant A, Wu K, Yu P and Chen M Performance analysis of dynamic finite versioning for concurrent transaction and query processing Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems, (103-114)
- Baeza-Yates R, Gonnet G and Ziviani N (1992). Improved bounds for the expected behaviour of AVL trees, BIT, 32:2, (297-315), Online publication date: 1-Jun-1992.
- Barcucci E and Verri M (1992). Some more properties of Catalan numbers, Discrete Mathematics, 102:3, (229-237), Online publication date: 22-May-1992.
- Lee K, Lu H and Fisher D A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's, (491-496)
- Čigas J (1992). The art of the state, ACM SIGCSE Bulletin, 24:1, (153-156), Online publication date: 1-Mar-1992.
- Čigas J The art of the state Proceedings of the twenty-third SIGCSE technical symposium on Computer science education, (153-156)
- Baker H (1992). The treadmill, ACM SIGPLAN Notices, 27:3, (66-70), Online publication date: 1-Mar-1992.
- Edelson D A mark-and-sweep collector C++ Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (51-58)
- Baker H (1991). Precise instruction scheduling without a precise machine model, ACM SIGARCH Computer Architecture News, 19:6, (4-8), Online publication date: 1-Dec-1991.
- Johnson B and Shneiderman B Tree-Maps Proceedings of the 2nd conference on Visualization '91, (284-291)
- Beaty S Genetic algorithms and instruction scheduling Proceedings of the 24th annual international symposium on Microarchitecture, (206-211)
- Higham N (1991). Algorithm 694, ACM Transactions on Mathematical Software, 17:3, (289-305), Online publication date: 1-Sep-1991.
- Küchlin W A space-efficient parallel garbage compaction algorithm Proceedings of the 5th international conference on Supercomputing, (40-46)
- Qin B, Sholl H and Ammar R (1991). Micro Time Cost Analysis of Parallel Computations, IEEE Transactions on Computers, 40:5, (613-628), Online publication date: 1-May-1991.
- Cutting D, Pedersen J and Halvorsen P An object-oriented architecture for text retrieval Intelligent Text and Image Handling, (285-298)
- Olariu S, Schwing J, Wen Z and Zhang J Optimal parallel encoding and decoding algorithms for trees Proceedings of the 19th annual conference on Computer Science, (1-10)
- Dutt S and Hayes J (1991). Subcube Allocation in Hypercube Computers, IEEE Transactions on Computers, 40:3, (341-352), Online publication date: 1-Mar-1991.
- Nicol D and O'Hallaron D (1991). Improved Algorithms for Mapping Pipelined and Parallel Computations, IEEE Transactions on Computers, 40:3, (295-306), Online publication date: 1-Mar-1991.
- Jones L Incremental switch-level simulation with zero/integer-delay Proceedings of the conference on European design automation, (334-338)
- Bryant R (1991). On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication, IEEE Transactions on Computers, 40:2, (205-213), Online publication date: 1-Feb-1991.
- Max N, Hanrahan P and Crawfis R (1990). Area and volume coherence for efficient visualization of 3D scalar functions, ACM SIGGRAPH Computer Graphics, 24:5, (27-33), Online publication date: 1-Nov-1990.
- Max N, Hanrahan P and Crawfis R Area and volume coherence for efficient visualization of 3D scalar functions Proceedings of the 1990 workshop on Volume visualization, (27-33)
- Baladi V and Guillement J (1990). A program for computing Puiseux expansions, ACM SIGSAM Bulletin, 24:4, (33-41), Online publication date: 1-Oct-1990.
- Von Herzen B, Barr A and Zatz H (1990). Geometric collisions for time-dependent parametric surfaces, ACM SIGGRAPH Computer Graphics, 24:4, (39-48), Online publication date: 1-Sep-1990.
- Von Herzen B, Barr A and Zatz H Geometric collisions for time-dependent parametric surfaces Proceedings of the 17th annual conference on Computer graphics and interactive techniques, (39-48)
- Chen M and Shin K (1990). Subcube Allocation and Task Migration in Hypercube Multiprocessors, IEEE Transactions on Computers, 39:9, (1146-1155), Online publication date: 1-Sep-1990.
- Kuittinen J, Nurmi O, Sippu S and Soisalon-Soininen E Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries Proceedings of the 16th International Conference on Very Large Data Bases, (372-379)
- Fong S Free indexation Proceedings of the 28th annual meeting on Association for Computational Linguistics, (105-110)
- Steele G and White J (1990). How to print floating-point numbers accurately, ACM SIGPLAN Notices, 25:6, (112-126), Online publication date: 1-Jun-1990.
- Kessler P (1990). Fast breakpoints: design and implementation, ACM SIGPLAN Notices, 25:6, (78-84), Online publication date: 1-Jun-1990.
- Steele G and White J How to print floating-point numbers accurately Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, (112-126)
- Kessler P Fast breakpoints: design and implementation Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, (78-84)
- Rosenkrantz D (1990). Half-Hot State Assignments for Finite State Machines, IEEE Transactions on Computers, 39:5, (700-702), Online publication date: 1-May-1990.
- Yu L and Rosenkrantz D Representability of design objects by ancestor-controlled hierarchical specifications Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (28-39)
- La Poutré J Lower bounds for the union-find and the split-find problem on pointer machines Proceedings of the twenty-second annual ACM symposium on Theory of Computing, (34-44)
- Frederickson G The information theory bound is tight for selection in a heap Proceedings of the twenty-second annual ACM symposium on Theory of Computing, (26-33)
- Vogt C (1990). A Buffer-Based Method for Storage Allocation in an Object-Oriented System, IEEE Transactions on Computers, 39:3, (375-383), Online publication date: 1-Mar-1990.
- Glew A (1990). An empirical investigation of OR indexing, ACM SIGMETRICS Performance Evaluation Review, 17:2, (41-49), Online publication date: 1-Jan-1990.
- Li K and Cheng K A two dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system Proceedings of the 1990 ACM annual conference on Cooperation, (22-27)
- 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)
- Bookstein A and Klein S Construction of optimal graphs for bit-vector compression Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval, (327-342)
- Lang S, Driscoll J and Jou J (1989). A unified analysis of batched searching of sequential and tree-structured files, ACM Transactions on Database Systems, 14:4, (604-618), Online publication date: 1-Dec-1989.
- Barkley R and Lee T (1989). A lazy buddy system bounded by two coalescing delays, ACM SIGOPS Operating Systems Review, 23:5, (167-176), Online publication date: 1-Nov-1989.
- Barkley R and Lee T A lazy buddy system bounded by two coalescing delays Proceedings of the twelfth ACM symposium on Operating systems principles, (167-176)
- Schelvis M (1989). Incremental distribution of timestamp packets: a new approach to distributed garbage collection, ACM SIGPLAN Notices, 24:10, (37-48), Online publication date: 1-Oct-1989.
- Schelvis M Incremental distribution of timestamp packets: a new approach to distributed garbage collection Conference proceedings on Object-oriented programming systems, languages and applications, (37-48)
- Ho C and Johnsson S Dilation d embedding of a hyper-pyramid into a hypercube Proceedings of the 1989 ACM/IEEE conference on Supercomputing, (294-303)
- Baker J Macrotasking the singluar value decomposition of block circulant matrices on the Cray-2 Proceedings of the 1989 ACM/IEEE conference on Supercomputing, (243-247)
- Neufeld G (1989). Descriptive names in X.500, ACM SIGCOMM Computer Communication Review, 19:4, (64-71), Online publication date: 1-Aug-1989.
- Neufeld G Descriptive names in X.500 Symposium proceedings on Communications architectures & protocols, (64-71)
- Shaw A (1989). Reasoning About Time in Higher-Level Language Software, IEEE Transactions on Software Engineering, 15:7, (875-889), Online publication date: 1-Jul-1989.
- Annaratone M, Pommerell C and Rühl R (1989). Interprocessor communication speed and performance in distributed-memory parallel processors, ACM SIGARCH Computer Architecture News, 17:3, (315-324), Online publication date: 1-Jun-1989.
- Chen M and Shin K (1989). Task migration in hypercube multiprocessors, ACM SIGARCH Computer Architecture News, 17:3, (105-111), Online publication date: 1-Jun-1989.
- Ibbett R, Hopkins T and McKinnon K (1989). Architectural mechanisms to support sparse vector processing, ACM SIGARCH Computer Architecture News, 17:3, (64-71), Online publication date: 1-Jun-1989.
- Kumar A, Kumar S, Kulshreshtha P and Ghose S Automatic synthesis of microprogrammed control units from behavioral descriptions Proceedings of the 26th ACM/IEEE Design Automation Conference, (147-154)
- May C (1989). The Parallel Assignment Problem Redefined, IEEE Transactions on Software Engineering, 15:6, (821-824), Online publication date: 1-Jun-1989.
- Annaratone M, Pommerell C and Rühl R Interprocessor communication speed and performance in distributed-memory parallel processors Proceedings of the 16th annual international symposium on Computer architecture, (315-324)
- Chen M and Shin K Task migration in hypercube multiprocessors Proceedings of the 16th annual international symposium on Computer architecture, (105-111)
- Ibbett R, Hopkins T and McKinnon K Architectural mechanisms to support sparse vector processing Proceedings of the 16th annual international symposium on Computer architecture, (64-71)
- Aoe J (1989). Storing a tree structure by using decimal notation, ACM SIGIR Forum, 23:3-4, (8-21), Online publication date: 1-Apr-1989.
- Moskowitz J and Jousselin C (1989). An algebraic memory model, ACM SIGARCH Computer Architecture News, 17:1, (55-62), Online publication date: 1-Mar-1989.
- Shasha D and Zhang K Fast parallel algorithms for the unit cost editing distance between trees Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, (117-126)
- Martin H and Orr B A random binary tree generator Proceedings of the 17th conference on ACM Annual Computer Science Conference, (33-38)
- Nicol D (1989). Optimal Partitioning of Random Programs Across Two Processors, IEEE Transactions on Software Engineering, 15:2, (134-141), Online publication date: 1-Feb-1989.
- Miller R and Stout Q Computational geometry on hypercube computers Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2, (1220-1229)
- Richards D and Vaidya P (1988). On the distribution of comparisons in sorting algorithms, BIT, 28:4, (764-774), Online publication date: 1-Dec-1988.
- Ceruzzi P (1988). Electronics Technology and Computer Science, 1940-1975, IEEE Annals of the History of Computing, 10:4, (257-275), Online publication date: 1-Oct-1988.
- Smith C (1988). Applying Synthesis Principles to Create Responsive Software Systems, IEEE Transactions on Software Engineering, 14:10, (1394-1408), Online publication date: 1-Oct-1988.
- Mateti P and Manghirmalani R (1988). Morris' tree traversal algorithm reconsidered, Science of Computer Programming, 11:1, (29-43), Online publication date: 1-Oct-1988.
- Lynch C Selectivity Estimation and Query Optimization in Large Databases with Highly Skewed Distribution of Column Values Proceedings of the 14th International Conference on Very Large Data Bases, (240-251)
- Savir J Why partial design verification works better than it should Proceedings of the 25th ACM/IEEE Design Automation Conference, (704-707)
- Agrawal V, Seth S and Agrawal P LSI product quality and fault coverage Papers on Twenty-five years of electronic design automation, (404-411)
- Schuler D and Ulrich E Clustering and linear placement Papers on Twenty-five years of electronic design automation, (50-56)
- Kantabutra V (1988). A lower bound on the path length of binary trees, ACM SIGACT News, 19:2, (48-50), Online publication date: 1-Jun-1988.
- Ponder C, McGeer P and Ng A (1988). Are applicative languages inefficient?, ACM SIGPLAN Notices, 23:6, (135-139), Online publication date: 1-Jun-1988.
- Gerasch T (1988). An insertion algorithm for a minimal internal path length binary search tree, Communications of the ACM, 31:5, (579-585), Online publication date: 1-May-1988.
- Samet H and Webber R (1988). Hierarchical Data Structures and Algorithms for Computer Graphics. Part I., IEEE Computer Graphics and Applications, 8:3, (48-68), Online publication date: 1-May-1988.
- Unnikrishnan A, Shankar P and Venkatesh Y (1988). Threaded Linear Hierarchical Quadtrees for Computation of Geometric Properties of Binary Images, IEEE Transactions on Software Engineering, 14:5, (659-665), Online publication date: 1-May-1988.
- Feiner S (1988). Seeing the forest for the trees: hierarchical displays of hypertext structures, ACM SIGOIS Bulletin, 9:2-3, (205-212), Online publication date: 1-Apr-1988.
- Mazer M (1988). Problems in modelling tasks and task views, ACM SIGOIS Bulletin, 9:2-3, (38-45), Online publication date: 1-Apr-1988.
- Rolfe T (1988). Generations of permutations with non-unique elements, ACM SIGNUM Newsletter, 23:2, (24-28), Online publication date: 1-Apr-1988.
- Feiner S Seeing the forest for the trees: hierarchical displays of hypertext structures Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems, (205-212)
- Mazer M Problems in modelling tasks and task views Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems, (38-45)
- Salton G and Buckley C (1988). Parallel text search methods, Communications of the ACM, 31:2, (202-215), Online publication date: 1-Feb-1988.
- Pfauntsch J and Shub C Graphic animation and speech synthesis applications for the auditory and visually disabled Proceedings of the 1988 ACM sixteenth annual conference on Computer science, (397-401)
- Dutt S and Hayes J On allocating subcubes in a hypercube multiprocessor Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1, (801-810)
- Kandlur D and Shin K Hypercube management in the presence of node failures Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1, (328-336)
- Wittenburg K Predictive combinators Proceedings of the 25th annual meeting on Association for Computational Linguistics, (73-80)
- Barklund J (1987). Efficient interpretation of Prolog programs, ACM SIGPLAN Notices, 22:7, (132-137), Online publication date: 1-Jul-1987.
- Barklund J Efficient interpretation of Prolog programs Papers of the Symposium on Interpreters and interpretive techniques, (132-137)
- Burgdorff H, Jajodia S, Springsteel F and Zalcstein Y (1987). Alternative methods for the reconstruction of trees from their traversals, BIT, 27:2, (133-140), Online publication date: 1-Jun-1987.
- Hui R (1987). Some uses of { and }, ACM SIGAPL APL Quote Quad, 17:4, (55-63), Online publication date: 1-May-1987.
- Burkholder L (1987). The halting problem, ACM SIGACT News, 18:3, (48-60), Online publication date: 1-Apr-1987.
- Osterweil L Software processes are software too Proceedings of the 9th international conference on Software Engineering, (2-13)
- Bastani F and Iyengar S (1987). The effect of data structures on the logical complexity of programs, Communications of the ACM, 30:3, (250-259), Online publication date: 1-Mar-1987.
- Kelsh J and Hansen J (1987). A simple virtual machine, ACM SIGSMALL/PC Notes, 13:1, (11-15), Online publication date: 1-Feb-1987.
- Hui R Some uses of { and } Proceedings of the international conference on APL: APL in transition, (55-63)
- Rattan I (1987). Memory management units for microcomputer operating systems, ACM SIGOPS Operating Systems Review, 21:1, (34-38), Online publication date: 1-Jan-1987.
- Carlson D Time-space tradeoffs for tree search and traversal Proceedings of 1986 ACM Fall joint computer conference, (585-594)
- Ching W (1986). Program analysis and code generation in an APL/370 compiler, IBM Journal of Research and Development, 30:6, (594-602), Online publication date: 1-Nov-1986.
- Edelsbrunner H and Guibas L Topologically sweeping an arrangement Proceedings of the eighteenth annual ACM symposium on Theory of computing, (389-403)
- Fowler R The complexity of using forwarding addresses for decentralized object finding Proceedings of the fifth annual ACM symposium on Principles of distributed computing, (108-120)
- Hayden M and Lamagna E Summation of binomial coefficients using hypergeometric functions Proceedings of the fifth ACM symposium on Symbolic and algebraic computation, (77-81)
- Morita Y, Yokota H, Nishida K and Itoh H Retrieval-By-Unification Operation on a Relational Knowledge Base Proceedings of the 12th International Conference on Very Large Data Bases, (52-59)
- Sarnak N and Tarjan R (1986). Planar point location using persistent search trees, Communications of the ACM, 29:7, (669-679), Online publication date: 1-Jul-1986.
- Jakobsson M Autocompletion in full text transaction entry: a method for humanized input Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, (327-332)
- Jakobsson M (1986). Autocompletion in full text transaction entry: a method for humanized input, ACM SIGCHI Bulletin, 17:4, (327-332), Online publication date: 1-Apr-1986.
- Gurevich Y (1986). What does O(n) mean, ACM SIGACT News, 17:4, (61-63), Online publication date: 1-Mar-1986.
- Yeh D and Munakata T (1986). Dynamic initial allocation and local reallocation procedures for multiple stacks, Communications of the ACM, 29:2, (134-141), Online publication date: 1-Feb-1986.
- Johnson G and Walz J A maximum-flow approach to anomaly isolation in unification-based incremental type inference Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (44-57)
- Culberson J The effect of updates in binary search trees Proceedings of the seventeenth annual ACM symposium on Theory of computing, (205-212)
- Barel M (1985). A high speed list processor for discrete event multiprocessor, ACM SIGSIM Simulation Digest, 16:4, (20-27), Online publication date: 1-Oct-1985.
- Shaw D NON-VON's applicability to three AI task area Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1, (61-72)
- Albizuri-Romero M (1985). Internal representation of programs in GRASE, ACM SIGPLAN Notices, 20:8, (41-50), Online publication date: 1-Aug-1985.
- Sohi G, Davidson E and Patel J An efficient LISP-execution architecture with a new representation for list structures Proceedings of the 12th annual international symposium on Computer architecture, (91-98)
- Ram A and Patel J Parallel garbage collection without synchronization overhead Proceedings of the 12th annual international symposium on Computer architecture, (84-90)
- Kuo Y, Chen C and Hu T A heuristic algorithm for PLA block folding Proceedings of the 22nd ACM/IEEE Design Automation Conference, (744-747)
- Vitter J (1985). An efficient I/O interface for optical disks, ACM Transactions on Database Systems, 10:2, (129-162), Online publication date: 1-Jun-1985.
- Brassard G (1985). Crusade for a better notation, ACM SIGACT News, 17:1, (60-64), Online publication date: 1-Jun-1985.
- Sohi G, Davidson E and Patel J (1985). An efficient LISP-execution architecture with a new representation for list structures, ACM SIGARCH Computer Architecture News, 13:3, (91-98), Online publication date: 1-Jun-1985.
- Ram A and Patel J (1985). Parallel garbage collection without synchronization overhead, ACM SIGARCH Computer Architecture News, 13:3, (84-90), Online publication date: 1-Jun-1985.
- Maziar S (1985). Solution of the Tower of Hanoi problem using a binary tree, ACM SIGPLAN Notices, 20:5, (16-20), Online publication date: 1-May-1985.
- Oldehoeft R and Allan S (1985). Adaptive exact-fit storage management, Communications of the ACM, 28:5, (506-511), Online publication date: 1-May-1985.
- Chang A (1985). A note on the MODULO operation, ACM SIGPLAN Notices, 20:4, (19-23), Online publication date: 1-Apr-1985.
- Bainbridge R Montagovian Definite Clause Grammar Proceedings of the second conference on European chapter of the Association for Computational Linguistics, (25-34)
- Daini O (1985). A language-driven generalized numerical database translator, BIT, 25:1, (91-105), Online publication date: 1-Mar-1985.
- Traub J, Yemini Y and Woźniakowski H (1984). The statistical security of a statistical database, ACM Transactions on Database Systems, 9:4, (672-679), Online publication date: 5-Dec-1984.
- Ralston A (1984). The first course in computer science needs a mathematics corequisite, Communications of the ACM, 27:10, (1002-1005), Online publication date: 1-Oct-1984.
- Rivara M (1984). Design and data structure of fully adaptive, multigrid, finite-element software, ACM Transactions on Mathematical Software, 10:3, (242-264), Online publication date: 28-Aug-1984.
- Kronmal R and Peterson A (1984). An acceptance-complement analogue of the mixture-plus-acceptance-rejection method for generating random variables, ACM Transactions on Mathematical Software, 10:3, (271-281), Online publication date: 28-Aug-1984.
- Wise D (1984). Representing matrices as quadtrees for parallel processors, ACM SIGSAM Bulletin, 18:3, (24-25), Online publication date: 1-Aug-1984.
- Allen J and Kennedy K Automatic loop interchange Proceedings of the 1984 SIGPLAN symposium on Compiler construction, (233-246)
- Allen J and Kennedy K (1984). Automatic loop interchange, ACM SIGPLAN Notices, 19:6, (233-246), Online publication date: 1-Jun-1984.
- Gupta G (1984). Self-assessment procedure XIII, Communications of the ACM, 27:5, (435-443), Online publication date: 1-May-1984.
- Callaghan J (1984). A software implemented memory manager, ACM SIGPLAN Notices, 19:3, (24-31), Online publication date: 1-Mar-1984.
- Bozman G (1984). The software lookaside buffler reduces search overhead with linked lists, Communications of the ACM, 27:3, (222-227), Online publication date: 1-Mar-1984.
- Fenner T and Loizou G (1984). Loop-free algorithms for traversing binary trees, BIT, 24:1, (33-44), Online publication date: 1-Mar-1984.
- MacQueen D, Plotkin G and Sethi R An ideal model for recursive polymorphic types Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (165-174)
- Taylor D (1984). A portable pseudo-code for Pascal-like languages, ACM SIGPLAN Notices, 19:1, (68-77), Online publication date: 1-Jan-1984.
- Flanders H (1983). Coroutines in Pascal, ACM SIGPLAN Notices, 18:12, (49-56), Online publication date: 1-Dec-1983.
- Feldman Y A decidable propositional probabilistic dynamic logic Proceedings of the fifteenth annual ACM symposium on Theory of computing, (298-309)
- Sleator D and Tarjan R Self-adjusting binary trees Proceedings of the fifteenth annual ACM symposium on Theory of computing, (235-245)
- Guibas L and Stolfi J Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams Proceedings of the fifteenth annual ACM symposium on Theory of computing, (221-234)
- Hecht M and Gabbe J (1983). Shadowed management of free disk pages with a linked list, ACM Transactions on Database Systems, 8:4, (503-514), Online publication date: 1-Dec-1983.
- Fraenkel A, Mor M and Perl Y (1983). Is text compression by prefixes and suffixes practical?, Acta Informatica, 20:4, (371-389), Online publication date: 1-Dec-1983.
- Korsh J and Laison G (1983). A multiple-stack manipulation procedure, Communications of the ACM, 26:11, (921-923), Online publication date: 1-Nov-1983.
- Eppinger J (1983). An empirical study of insertion and deletion in binary search trees, Communications of the ACM, 26:9, (663-669), Online publication date: 1-Sep-1983.
- Chazelle B (1983). The Bottomn-Left Bin-Packing Heuristic, IEEE Transactions on Computers, 32:8, (697-707), Online publication date: 1-Aug-1983.
- Coffman, Jr. E (2006). An Introduction to Combinatorial Models of Dynamic Storage Allocation, SIAM Review, 25:3, (311-325), Online publication date: 1-Jul-1983.
- Lomet D A high performance, universal, key associative access method Proceedings of the 1983 ACM SIGMOD international conference on Management of data, (120-133)
- Lomet D (1983). A high performance, universal, key associative access method, ACM SIGMOD Record, 13:4, (120-133), Online publication date: 1-May-1983.
- Taylor R (1983). A general-purpose algorithm for analyzing concurrent programs, Communications of the ACM, 26:5, (361-376), Online publication date: 1-May-1983.
- Lomet D (1983). Bounded index exponential hashing, ACM Transactions on Database Systems, 8:1, (136-165), Online publication date: 1-Mar-1983.
- Fontana J Pascal procedures and functions for teaching linear data structures Proceedings of the fourteenth SIGCSE technical symposium on Computer science education, (178-186)
- Culik K and Rizki M Logic versus mathematics in computer science education Proceedings of the fourteenth SIGCSE technical symposium on Computer science education, (14-20)
- Fontana J (1983). Pascal procedures and functions for teaching linear data structures, ACM SIGCSE Bulletin, 15:1, (178-186), Online publication date: 1-Feb-1983.
- Culik K and Rizki M (1983). Logic versus mathematics in computer science education, ACM SIGCSE Bulletin, 15:1, (14-20), Online publication date: 1-Feb-1983.
- Back R, Mannila H and Räihä K Derivation of efficient DAG marking algorithms Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (20-27)
- Agrawal R, Carey M and DeWitt D (1983). Deadlock detection is cheap, ACM SIGMOD Record, 13:2, (19-34), Online publication date: 1-Jan-1983.
- Shani U (1983). Should program editors not abandon text oriented commands?, ACM SIGPLAN Notices, 18:1, (35-41), Online publication date: 1-Jan-1983.
- Bonnin A and Pallo J (1983). A-transformation dans les arbres n-aires, Discrete Mathematics, 45:2-3, (153-163), Online publication date: 1-Jan-1983.
- Supowit K and Reingold E (1983). The complexity of drawing trees nicely, Acta Informatica, 18:4, (377-392), Online publication date: 1-Jan-1983.
- Vitter J (1982). Implementations for coalesced hashing, Communications of the ACM, 25:12, (911-926), Online publication date: 1-Dec-1982.
- Skibbe R (1982). PACE - a microprogram evaluation system, ACM SIGMICRO Newsletter, 13:4, (181-191), Online publication date: 1-Dec-1982.
- Ancona M and De Floriani L (1982). Computational algorithms for hierarchically structured project networks, Operations Research Letters, 1:5, (170-176), Online publication date: 1-Nov-1982.
- Skibbe R PACE - a microprogram evaluation system Proceedings of the 15th annual workshop on Microprogramming, (181-191)
- Cohen J (1982). Computer-assisted microanalysis of programs, Communications of the ACM, 25:10, (724-733), Online publication date: 1-Oct-1982.
- Beck L (1982). A dynamic storage allocation technique based on memory residence time, Communications of the ACM, 25:10, (714-724), Online publication date: 1-Oct-1982.
- Blackford J and Taylor R (1982). APL and the relational model, ACM SIGAPL APL Quote Quad, 13:1, (40-48), Online publication date: 1-Sep-1982.
- Andrews G and Levin G On-the-fly deadlock prevention Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing, (165-172)
- Snyder L (1982). Recognition and selection of idioms for code optimization, Acta Informatica, 17:3, (327-348), Online publication date: 1-Aug-1982.
- Blackford J and Taylor R APL and the relational model Proceedings of the international conference on APL, (40-48)
- Goad C Special purpose automatic programming for hidden surface elimination Proceedings of the 9th annual conference on Computer graphics and interactive techniques, (167-178)
- Kasik D A user interface management system Proceedings of the 9th annual conference on Computer graphics and interactive techniques, (99-106)
- Goad C (1982). Special purpose automatic programming for hidden surface elimination, ACM SIGGRAPH Computer Graphics, 16:3, (167-178), Online publication date: 1-Jul-1982.
- Kasik D (1982). A user interface management system, ACM SIGGRAPH Computer Graphics, 16:3, (99-106), Online publication date: 1-Jul-1982.
- Daini O Numerical database management system Proceedings of the 1982 ACM SIGMOD international conference on Management of data, (192-199)
- Ford G (1982). A framework for teaching recursion, ACM SIGCSE Bulletin, 14:2, (32-39), Online publication date: 1-Jun-1982.
- Levitan S and Foster C Finding an extremum in a network Proceedings of the 9th annual symposium on Computer Architecture, (321-325)
- Mudge T and Makrucki B Probabilistic analysis of a crossbar switch Proceedings of the 9th annual symposium on Computer Architecture, (311-320)
- Becker R and Schach S Drawing labelled directed binary graphs on a grid Proceedings of the 20th annual Southeast regional conference, (30-34)
- Levitan S and Foster C (1982). Finding an extremum in a network, ACM SIGARCH Computer Architecture News, 10:3, (321-325), Online publication date: 1-Apr-1982.
- Mudge T and Makrucki B (1982). Probabilistic analysis of a crossbar switch, ACM SIGARCH Computer Architecture News, 10:3, (311-320), Online publication date: 1-Apr-1982.
- O'Donnell M and Smith C (1982). A Combinatorial Problem Concerning Processor Interconnection Networks, IEEE Transactions on Computers, 31:2, (163-164), Online publication date: 1-Feb-1982.
- Reps T Optimal-time incremental semantic analysis for syntax-directed editors Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (169-176)
- Lipton R, Sedgewick R and Valdes J Programming aspects of VLSI Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (57-65)
- Lipton R, North S, Sedgewick R, Valdes J and Vijayan G ALI Proceedings of the 19th Design Automation Conference, (467-474)
- 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.
- Kapur D, Musser D and Stepanov A Operators and algebraic structures Proceedings of the 1981 conference on Functional programming languages and computer architecture, (59-64)
- Kuenning G Minimal multitasking operating systems for real-time controllers Proceedings of the 1981 ACM SIGSMALL symposium on Small systems and SIGMOD workshop on Small database systems, (20-27)
- Kuenning G (1981). Minimal multitasking operating systems for real-time controllers, ACM SIGSMALL Newsletter, 7:2, (20-27), Online publication date: 1-Oct-1981.
- Lynch C and Brownrigg E Application of data compression to a large bibliographic data base Proceedings of the seventh international conference on Very Large Data Bases - Volume 7, (435-447)
- Agrawal V, Seth S and Agrawal P LSI product quality and fault coverage Proceedings of the 18th Design Automation Conference, (196-203)
- Reid B and Hanson D An annotated bibliography of background material on text manipulation Proceedings of the ACM SIGPLAN SIGOA symposium on Text manipulation, (157-160)
- Reid B and Hanson D (1981). An annotated bibliography of background material on text manipulation, ACM SIGPLAN Notices, 16:6, (157-160), Online publication date: 1-Jun-1981.
- Jia-Wei H and Rosenberg A Graphs that are almost binary trees (Preliminary Version) Proceedings of the thirteenth annual ACM symposium on Theory of computing, (334-341)
- Murray N (1981). Some Observations on Equivalence Handling Methods, IEEE Transactions on Computers, 30:5, (361-362), Online publication date: 1-May-1981.
- Artzy E and Herman G (1981). Boundary detection in 3-dimensions with a medical application, ACM SIGGRAPH Computer Graphics, 15:1, (92-123), Online publication date: 1-Apr-1981.
- Reid B and Hanson D (1981). An annotated bibliography of background material on text manipulation, ACM SIGOA Newsletter, 2:1-2, (157-160), Online publication date: 1-Apr-1981.
- Forman I On the time overhead of counters and traversal markers Proceedings of the 5th international conference on Software engineering, (164-169)
- Benard M A foundations course for a developing computer science program Proceedings of the twelfth SIGCSE technical symposium on Computer science education, (188-191)
- Shub C A machine independent assembler course Proceedings of the twelfth SIGCSE technical symposium on Computer science education, (115-119)
- Benard M (1981). A foundations course for a developing computer science program, ACM SIGCSE Bulletin, 13:1, (188-191), Online publication date: 1-Feb-1981.
- Shub C (1981). A machine independent assembler course, ACM SIGCSE Bulletin, 13:1, (115-119), Online publication date: 1-Feb-1981.
- Hausman D (1981). Adjacent vertices on the b-matching polyhedron, Discrete Mathematics, 33:1, (37-51), Online publication date: 1-Jan-1981.
- Steele G and Sussman G (1980). Design of a LISP-based microprocessor, Communications of the ACM, 23:11, (628-645), Online publication date: 1-Nov-1980.
- Beyer T and Hedetniemi S (1980). Constant Time Generation of Rooted Trees, SIAM Journal on Computing, 9:4, (706-712), Online publication date: 1-Nov-1980.
- Lee D and Wong C (1980). Quintary trees, ACM Transactions on Database Systems, 5:3, (339-353), Online publication date: 1-Sep-1980.
- Shani U Filling regions in binary raster images Proceedings of the 7th annual conference on Computer graphics and interactive techniques, (321-327)
- Artzy E, Frieder G and Herman G The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm Proceedings of the 7th annual conference on Computer graphics and interactive techniques, (2-9)
- Shani U (1980). Filling regions in binary raster images, ACM SIGGRAPH Computer Graphics, 14:3, (321-327), Online publication date: 1-Jul-1980.
- Artzy E, Frieder G and Herman G (1980). The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm, ACM SIGGRAPH Computer Graphics, 14:3, (2-9), Online publication date: 1-Jul-1980.
- Samet H (1980). A Coroutine Approach to Parsing, ACM Transactions on Programming Languages and Systems, 2:3, (290-306), Online publication date: 1-Jul-1980.
- Lozinskii E (1980). Construction of relations in relational databases, ACM Transactions on Database Systems, 5:2, (208-224), Online publication date: 1-Jun-1980.
- Allchin J, Keller A and Wiederhold G FLASH Proceedings of the 1980 ACM SIGMOD international conference on Management of data, (151-156)
- Gill A (1980). Hierarchical binary search, Communications of the ACM, 23:5, (294-300), Online publication date: 1-May-1980.
- Sethi I and Chatterjee B (1980). Conversion of decision tables to efficient sequential testing procedures, Communications of the ACM, 23:5, (279-285), Online publication date: 1-May-1980.
- Guibas L and Yao F On translating a set of rectangles Proceedings of the twelfth annual ACM symposium on Theory of computing, (154-160)
- Turton T (1980). The management of operating system state data, ACM SIGOPS Operating Systems Review, 14:2, (21-24), Online publication date: 1-Apr-1980.
- Kaufman A Variations on the binary buddy system for dynamic memory management Proceedings of the 18th annual Southeast regional conference, (73-78)
- Gopalakrishna V and Veni Madhavan C (1980). Performance evaluation of attribute-based tree organization, ACM Transactions on Database Systems, 5:1, (69-87), Online publication date: 1-Mar-1980.
- Shub C Simulation of structured hardware designs Proceedings of the 12th conference on Winter simulation, (305-312)
- Dershowitz N and Zaks S (1980). Enumerations of ordered trees, Discrete Mathematics, 31:1, (9-28), Online publication date: 1-Jan-1980.
- Lampson B and Sproull R An open operating system for a single-user machine Proceedings of the seventh ACM symposium on Operating systems principles, (98-105)
- Housel B (1979). Pipelining, ACM Transactions on Database Systems, 4:4, (470-492), Online publication date: 1-Dec-1979.
- Hu T, Kleitman D and Tamaki J (1979). Binary Trees Optimum Under Various Criteria, SIAM Journal on Applied Mathematics, 37:2, (246-256), Online publication date: 1-Oct-1979.
- Cohen J Computer-aided micro-analysis of programs Proceedings of the 4th international conference on Software engineering, (79-84)
- Hansen W (1979). Progressive acyclic digraphs—a tool for database integrity, Communications of the ACM, 22:9, (513-518), Online publication date: 1-Sep-1979.
- Comer D (1979). Heuristics for trie index minimization, ACM Transactions on Database Systems, 4:3, (383-395), Online publication date: 1-Sep-1979.
- Yu S and Murata T (1979). Modeling and simulating data flow computations at machine language level, ACM SIGSIM Simulation Digest, 11:1, (207-213), Online publication date: 1-Sep-1979.
- Yu S and Murata T (1979). Modeling and simulating data flow computations at machine language level, ACM SIGMETRICS Performance Evaluation Review, 8:3, (207-213), Online publication date: 1-Sep-1979.
- Bentley J and Saxe J (1979). Algorithms on vector sets, ACM SIGACT News, 11:2, (36-39), Online publication date: 1-Sep-1979.
- Yu S and Murata T Modeling and simulating data flow computations at machine language level Proceedings of the 1979 ACM SIGMETRICS conference on Simulation, measurement and modeling of computer systems, (207-213)
- Fuchs H, Kedem Z and Naylor B Predetermining visibility priority in 3-D scenes (Preliminary Report) Proceedings of the 6th annual conference on Computer graphics and interactive techniques, (175-181)
- Fuchs H, Kedem Z and Naylor B (1979). Predetermining visibility priority in 3-D scenes (Preliminary Report), ACM SIGGRAPH Computer Graphics, 13:2, (175-181), Online publication date: 1-Aug-1979.
- Stoutemyer D (1979). Computer symbolic math & education, ACM SIGSAM Bulletin, 13:3, (8-24), Online publication date: 1-Aug-1979.
- Winograd T (1979). Beyond programming languages, Communications of the ACM, 22:7, (391-401), Online publication date: 1-Jul-1979.
- Foster G (1979). On the locus of program flow within and among secondary functions, ACM SIGAPL APL Quote Quad, 9:4-P1, (333-339), Online publication date: 1-Jun-1979.
- Denenberg S and Peelle H (1979). Teaching computer science with APL, ACM SIGAPL APL Quote Quad, 9:4-P1, (313-320), Online publication date: 1-Jun-1979.
- Yao S (1979). Optimization of query evaluation algorithms, ACM Transactions on Database Systems, 4:2, (133-155), Online publication date: 1-Jun-1979.
- Foster G On the locus of program flow within and among secondary functions Proceedings of the international conference on APL: part 1, (333-339)
- Denenberg S and Peelle H Teaching computer science with APL Proceedings of the international conference on APL: part 1, (313-320)
- Hunt H and Rosenkrantz D The complexity of testing predicate locks Proceedings of the 1979 ACM SIGMOD international conference on Management of data, (127-133)
- Yu C, Siu M, Lam K and Ozsoyoglu M Performance analysis of three related assignment problems Proceedings of the 1979 ACM SIGMOD international conference on Management of data, (82-92)
- Rosenberg A, Wood D and Galil Z Storage representations for tree-like data structures Proceedings of the eleventh annual ACM symposium on Theory of computing, (99-107)
- Flajolet P, Françon J and Vuillemin J Computing integrated costs of sequences of operations with application to dictionaries Proceedings of the eleventh annual ACM symposium on Theory of computing, (49-61)
- Valdes J, Tarjan R and Lawler E The recognition of Series Parallel digraphs Proceedings of the eleventh annual ACM symposium on Theory of computing, (1-12)
- Sakamura K, Nakano K, Kato Y and Aiso H A new approach to an adaptive computer—an automatic recovery mechanism to prevent the occurrence of subtract errors Proceedings of the 6th annual symposium on Computer architecture, (31-41)
- Honkanen P Storage reduction in relational database systems using spanning trees and other graph theoretic methods Proceedings of the 17th annual Southeast regional conference, (32-37)
- Comfort J A taxonomy and analysis of event set management algorithms for discrete event simulation Proceedings of the 12th annual symposium on Simulation, (115-146)
- Alpert S (1979). A tree representation in APL, ACM SIGAPL APL Quote Quad, 9:3, (25-28), Online publication date: 1-Mar-1979.
- Meinke J and Beidler J (1979). A software emphasis in the second course in computer science, ACM SIGCSE Bulletin, 11:1, (192-194), Online publication date: 1-Feb-1979.
- Mackey K and Fosdick H (1979). An applied computer science/systems programming approach to teaching data structures, ACM SIGCSE Bulletin, 11:1, (76-78), Online publication date: 1-Feb-1979.
- Hyde D, Gay B and Utter D (1979). The integration of a Problem Solving Process in the first course, ACM SIGCSE Bulletin, 11:1, (54-59), Online publication date: 1-Feb-1979.
- Cheriton D, Malcolm M, Melen L and Sager G (1979). Thoth, a portable real-time operating system, Communications of the ACM, 22:2, (105-115), Online publication date: 1-Feb-1979.
- Sakoda J (1979). DYSTAL 2, ACM SIGPLAN Notices, 14:1, (77-90), Online publication date: 1-Jan-1979.
- Meinke J and Beidler J A software emphasis in the second course in computer science Proceedings of the tenth SIGCSE technical symposium on Computer science education, (192-194)
- Mackey K and Fosdick H An applied computer science/systems programming approach to teaching data structures Proceedings of the tenth SIGCSE technical symposium on Computer science education, (76-78)
- Hyde D, Gay B and Utter D The integration of a Problem Solving Process in the first course Proceedings of the tenth SIGCSE technical symposium on Computer science education, (54-59)
- Reif J Data flow analysis of communicating processes Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (257-268)
- Lee S, deRoever W and Gerhart S The evolution of list-copying algorithms and the need for structured program verification Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (53-67)
- Abramson H, Fox M, Gorlick M, Manis V and Peck J The Pica-B Computer An Abstract Target Machine For A Transportable Single-User Operating Environment Proceedings of the 1978 annual conference, (301-309)
- Albright R and Smith B (1978). BRAINO, ACM SIGCSE Bulletin, 10:4, (59-65), Online publication date: 1-Dec-1978.
- Mulvey J (1978). Testing of a large-scale network optimization program, Mathematical Programming: Series A and B, 15:1, (291-314), Online publication date: 1-Dec-1978.
- Sheil B (1978). Median split trees, Communications of the ACM, 21:11, (947-958), Online publication date: 1-Nov-1978.
- Sedgewick R (1978). Implementing Quicksort programs, Communications of the ACM, 21:10, (847-857), Online publication date: 1-Oct-1978.
- Kaufman A (1978). System design and implementation of BGRAF2, ACM SIGGRAPH Computer Graphics, 12:3, (87-92), Online publication date: 23-Aug-1978.
- Kaufman A System design and implementation of BGRAF2 Proceedings of the 5th annual conference on Computer graphics and interactive techniques, (87-92)
- Morris F (1978). A time- and space-efficient garbage compaction algorithm, Communications of the ACM, 21:8, (662-665), Online publication date: 1-Aug-1978.
- Hirschberg D (1978). Fast parallel sorting algorithms, Communications of the ACM, 21:8, (657-661), Online publication date: 1-Aug-1978.
- Moenck R (1978). Is a linked list the best storage structure for an algebra system?, ACM SIGSAM Bulletin, 12:3, (20-24), Online publication date: 1-Aug-1978.
- Baker H (1978). Shallow binding in Lisp 1.5, Communications of the ACM, 21:7, (565-569), Online publication date: 1-Jul-1978.
- Chin F (1978). An O(n) algorithm for determining a near-optimal computation order of matrix chain products, Communications of the ACM, 21:7, (544-549), Online publication date: 1-Jul-1978.
- Cohen J and Roth M (1978). Analyses of deterministic parsing algorithms, Communications of the ACM, 21:6, (448-458), Online publication date: 1-Jun-1978.
- 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.
- Brown M and Tarjan R A representation for linear lists with movable fingers Proceedings of the tenth annual ACM symposium on Theory of computing, (19-29)
- Low J (1978). Automatic data structure selection, Communications of the ACM, 21:5, (376-385), Online publication date: 1-May-1978.
- Clark D (1978). A fast algorithm for copying list structures, Communications of the ACM, 21:5, (351-357), Online publication date: 1-May-1978.
- Barr R, Herman-Giddens G, Warren R and Spach M Two-level control of a real-time data acquisition and control system for studying the electrical activity of the heart Proceedings of the 16th annual Southeast regional conference, (288-294)
- Twine D An interactive system for allocating space in an efficient flexible manner Proceedings of the 16th annual Southeast regional conference, (227-235)
- Vuillemin J (1978). A data structure for manipulating priority queues, Communications of the ACM, 21:4, (309-315), Online publication date: 1-Apr-1978.
- Baker H (1978). List processing in real time on a serial computer, Communications of the ACM, 21:4, (280-294), Online publication date: 1-Apr-1978.
- Lew A (1978). Optimal conversion of extended-entry decision tables with general cost criteria, Communications of the ACM, 21:4, (269-279), Online publication date: 1-Apr-1978.
- Yelowitz L (1978). Notes on "A note on the transitive closure of a boolean matrix", ACM SIGACT News, 10:1, (30-30), Online publication date: 1-Apr-1978.
- DeMillo R, Eisenstat S and Lipton R (1978). Preserving average proximity in arrays, Communications of the ACM, 21:3, (228-231), Online publication date: 1-Mar-1978.
- Thalmann N and Thalmann D The use of PASCAL as a teaching tool in introductory, intermediate and advanced computer science courses Papers of the SIGCSE/CSA technical symposium on Computer science education, (277-281)
- Mathis R A first course in computer science for graduate students Papers of the SIGCSE/CSA technical symposium on Computer science education, (217-223)
- Schneider G The introductory programming course in computer science Papers of the SIGCSE/CSA technical symposium on Computer science education, (107-114)
- Ahmad S Design and use of instructional tools for computer science Papers of the SIGCSE/CSA technical symposium on Computer science education, (1-6)
- Thalmann N and Thalmann D (1978). The use of PASCAL as a teaching tool in introductory, intermediate and advanced computer science courses, ACM SIGCSE Bulletin, 10:1, (277-281), Online publication date: 1-Feb-1978.
- Mathis R (1978). A first course in computer science for graduate students, ACM SIGCSE Bulletin, 10:1, (217-223), Online publication date: 1-Feb-1978.
- Schneider G (1978). The introductory programming course in computer science, ACM SIGCSE Bulletin, 10:1, (107-114), Online publication date: 1-Feb-1978.
- Ahmad S (1978). Design and use of instructional tools for computer science, ACM SIGCSE Bulletin, 10:1, (1-6), Online publication date: 1-Feb-1978.
- Manna Z and Waldinger R (1978). Is “sometime” sometimes better than “always”?, Communications of the ACM, 21:2, (159-172), Online publication date: 1-Feb-1978.
- George A and McIntyre D (1978). On the Application of the Minimum Degree Algorithm to Finite Element Systems, SIAM Journal on Numerical Analysis, 15:1, (90-112), Online publication date: 1-Feb-1978.
- Young R and Wilson T A filing system with variable size attributes for the GASP simulation languages Proceedings of the 10th conference on Winter simulation - Volume 1, (323-328)
- Shub C On the relative merits of two major methodologies for simulation model construction Proceedings of the 10th conference on Winter simulation - Volume 1, (257-264)
- German S Automating proofs of the absence of common runtime errors Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (105-118)
- Reif J Symbolic program analysis in almost linear time Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (76-83)
- Abramson H (1977). Ordered types and a generalized for statement, ACM SIGPLAN Notices, 12:12, (55-59), Online publication date: 1-Dec-1977.
- Claybrook B (1977). A facility for defining and manipulating generalized data structures, ACM Transactions on Database Systems, 2:4, (370-406), Online publication date: 1-Dec-1977.
- Rheinboldt W, Mesztenyi C and Fitzgerald J (1977). On the evaluation of multivariate polynomials and their derivatives, BIT, 17:4, (437-450), Online publication date: 1-Dec-1977.
- Sprugnoli R (1977). Perfect hashing functions, Communications of the ACM, 20:11, (841-850), Online publication date: 1-Nov-1977.
- Shore J (1977). Anomalous behavior of the fifty-percent rule in dynamic memory allocation, Communications of the ACM, 20:11, (812-820), Online publication date: 1-Nov-1977.
- Härder T A scan-driven sort facility for a relational database system Proceedings of the third international conference on Very large data bases - Volume 3, (236-244)
- Silverston S (1977). Extensions to SNOBOL4 in the SNOBAT implementation, ACM SIGPLAN Notices, 12:9, (77-84), Online publication date: 1-Sep-1977.
- Mairson H (1977). Some new upper bounds on the generation of prime numbers, Communications of the ACM, 20:9, (664-669), Online publication date: 1-Sep-1977.
- Minker J (1977). Information storage and retrieval, ACM SIGIR Forum, 12:2, (12-108), Online publication date: 1-Sep-1977.
- Hobbs J What the nature of natural language tells us about how to make natural-language-like programming languages more natural Proceedings of the 1977 symposium on Artificial intelligence and programming languages, (85-93)
- Yelowitz L and Duncan A Abstractions, instantiations, and proofs of marking algorithms Proceedings of the 1977 symposium on Artificial intelligence and programming languages, (13-21)
- Schenk K and Pinkert J An algorithm for servicing multi-relational queries Proceedings of the 1977 ACM SIGMOD international conference on Management of data, (10-20)
- Potel M (1977). Real-time playback in animation systems, ACM SIGGRAPH Computer Graphics, 11:2, (72-77), Online publication date: 1-Aug-1977.
- Hobbs J (1977). What the nature of natural language tells us about how to make natural-language-like programming languages more natural, ACM SIGART Bulletin:64, (85-93), Online publication date: 1-Aug-1977.
- Yelowitz L and Duncan A (1977). Abstractions, instantiations, and proofs of marking algorithms, ACM SIGART Bulletin:64, (13-21), Online publication date: 1-Aug-1977.
- Hobbs J (1977). What the nature of natural language tells us about how to make natural-language-like programming languages more natural, ACM SIGPLAN Notices, 12:8, (85-93), Online publication date: 1-Aug-1977.
- Yelowitz L and Duncan A (1977). Abstractions, instantiations, and proofs of marking algorithms, ACM SIGPLAN Notices, 12:8, (13-21), Online publication date: 1-Aug-1977.
- Chanon R (1977). An experiment with an introductory course in computer science, ACM SIGCSE Bulletin, 9:3, (39-42), Online publication date: 1-Aug-1977.
- Augenstein M and Tenenbaum A (1977). Program efficiency and data structures, ACM SIGCSE Bulletin, 9:3, (21-27), Online publication date: 1-Aug-1977.
- Geschke C, Morris J and Satterthwaite E (1977). Early experience with Mesa, Communications of the ACM, 20:8, (540-553), Online publication date: 1-Aug-1977.
- Potel M Real-time playback in animation systems Proceedings of the 4th annual conference on Computer graphics and interactive techniques, (72-77)
- Grune D (1977). A view of coroutines, ACM SIGPLAN Notices, 12:7, (75-81), Online publication date: 1-Jul-1977.
- Barth J (1977). Shifting garbage collection overhead to compile time, Communications of the ACM, 20:7, (513-518), Online publication date: 1-Jul-1977.
- Wells M Implementation and application of a function data type Proceedings of the June 13-16, 1977, national computer conference, (389-395)
- McKinney M Variable-length hash area entries Proceedings of the June 13-16, 1977, national computer conference, (371-377)
- Bird R (1977). Notes on recursion elimination, Communications of the ACM, 20:6, (434-439), Online publication date: 1-Jun-1977.
- Peterson J and Norman T (1977). Buddy systems, Communications of the ACM, 20:6, (421-431), Online publication date: 1-Jun-1977.
- Brown M The complexity of priority queue maintenance Proceedings of the ninth annual ACM symposium on Theory of computing, (42-48)
- Tarjan R Reference machines require non-linear time to maintain disjoint sets Proceedings of the ninth annual ACM symposium on Theory of computing, (18-29)
- Hanani M (1977). An optimal evaluation of Boolean expressions in an online query system, Communications of the ACM, 20:5, (344-347), Online publication date: 1-May-1977.
- Griswold R and Hanson D (1977). An overview of SL5, ACM SIGPLAN Notices, 12:4, (40-50), Online publication date: 1-Apr-1977.
- Robinson L and Levitt K (1977). Proof techniques for hierarchically structured programs, Communications of the ACM, 20:4, (271-283), Online publication date: 1-Apr-1977.
- (1977). A clustering algorithm for hierarchical structures, ACM Transactions on Database Systems, 2:1, (27-44), Online publication date: 1-Mar-1977.
- Chanon R An experiment with an introductory course in computer science Proceedings of the eighth SIGCSE technical symposium on Computer science education, (39-42)
- Augenstein M and Tenenbaum A Program efficiency and data structures Proceedings of the eighth SIGCSE technical symposium on Computer science education, (21-27)
- Depth-first digraph algorithms without recursion Proceedings of the seventh SIGCSE technical symposium on Computer science education, (151-153)
- Maurer W The teaching of program correctness Proceedings of the seventh SIGCSE technical symposium on Computer science education, (142-144)
- (1977). Depth-first digraph algorithms without recursion, ACM SIGCSE Bulletin, 9:1, (151-153), Online publication date: 1-Feb-1977.
- Maurer W (1977). The teaching of program correctness, ACM SIGCSE Bulletin, 9:1, (142-144), Online publication date: 1-Feb-1977.
- Knott G (1977). A numbering system for binary trees, Communications of the ACM, 20:2, (113-115), Online publication date: 1-Feb-1977.
- Hobbs J From English descriptions of algorithms into programs Proceedings of the 1977 annual conference, (323-329)
- DeMillo R, Lipton R and Perlis A Social processes and proofs of theorems and programs Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (206-214)
- Reif J and Lewis H Symbolic evaluation and the global value graph Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (104-118)
- Batson A and Brundage R (1977). Segment sizes and liftetimes in Algol 60 programs, Communications of the ACM, 20:1, (36-44), Online publication date: 1-Jan-1977.
- Horowitz E The art of the algorithmist Proceedings of the 1976 annual conference, (442-444)
- Rather E and Moore C The FORTH approach to operating systems Proceedings of the 1976 annual conference, (233-240)
- Fosdick L and Osterweil L The detection of anomalous interprocedural data flow Proceedings of the 2nd international conference on Software engineering, (624-628)
- Wegner P Research paradigms in computer science Proceedings of the 2nd international conference on Software engineering, (322-330)
- Rubin S An application of tree structures to an interactive double-entry bookkeeping system Proceedings of the eighth international conference on APL, (337-342)
- Wells M (1976). Preprocessing of typed two-dimensional mathematical expressions, ACM SIGPLAN Notices, 11:9, (25-37), Online publication date: 1-Sep-1976.
- Haskell R, Boddy D and Jackson G Use of structured flowcharts in the undergraduate Computer Science curriculum Proceedings of the sixth SIGCSE technical symposium on Computer science education, (67-74)
- Meinke J and Bauer C Topological sorting as a tool in curriculum planning Proceedings of the sixth SIGCSE technical symposium on Computer science education, (61-66)
- Carvalho S and A. Nóvoa M On the use of pointers and the teaching of disciplined programming Proceedings of the sixth SIGCSE technical symposium on Computer science education, (26-29)
- Wadler P (1976). Analysis of an algorithm for real time garbage collection, Communications of the ACM, 19:9, (491-500), Online publication date: 1-Sep-1976.
- Zippel R Univariate power series expansions in algebraic manipulation Proceedings of the third ACM symposium on Symbolic and algebraic computation, (198-208)
- Dyer J and Mulvey J (1976). An Integrated Optimization/Information System for Academic Departmental Planning, Management Science, 22:12, (1332-1341), Online publication date: 1-Aug-1976.
- McClure C (1976). Ordering control data in structured COBOL, ACM SIGPLAN Notices, 11:8, (46-51), Online publication date: 1-Aug-1976.
- Kasik D (1976). Controlling user interaction, ACM SIGGRAPH Computer Graphics, 10:2, (109-115), Online publication date: 1-Aug-1976.
- Kasik D Controlling user interaction Proceedings of the 3rd annual conference on Computer graphics and interactive techniques, (109-115)
- Haskell R, Boddy D and Jackson G (1976). Use of structured flowcharts in the undergraduate Computer Science curriculum, ACM SIGCSE Bulletin, 8:3, (67-74), Online publication date: 1-Jul-1976.
- Meinke J and Bauer C (1976). Topological sorting as a tool in curriculum planning, ACM SIGCSE Bulletin, 8:3, (61-66), Online publication date: 1-Jul-1976.
- Carvalho S and A. Nóvoa M (1976). On the use of pointers and the teaching of disciplined programming, ACM SIGCSE Bulletin, 8:3, (26-29), Online publication date: 1-Jul-1976.
- Burton W (1976). A buddy system variation for disk storage allocation, Communications of the ACM, 19:7, (416-417), Online publication date: 1-Jul-1976.
- Ikemoto Y, Sugiyama T, Igarashi K and Kano H Correction and wiring check-system for master-slice LSI Proceedings of the 13th Design Automation Conference, (336-343)
- Chappell S, Menon P, Pellegrin J and Schowe A Functional simulation in the lamp system Proceedings of the 13th Design Automation Conference, (42-47)
- Greenberg H and Kalan J Representations of networks Proceedings of the June 7-10, 1976, national computer conference and exposition, (939-943)
- Clark D (1976). An efficient list-moving algorithm using constant workspace, Communications of the ACM, 19:6, (352-356), Online publication date: 1-Jun-1976.
- Wise D (1976). Referencing lists by an edge, Communications of the ACM, 19:6, (338-342), Online publication date: 1-Jun-1976.
- Burkhard W (1976). Hashing and trie algorithms for partial match retrieval, ACM Transactions on Database Systems, 1:2, (175-187), Online publication date: 1-Jun-1976.
- Kodandapani K and Pradhan D Further results on m-RMC expansions for m-valued functions Proceedings of the sixth international symposium on Multiple-valued logic, (88-92)
- Burkhard W Associative retrieval trie hash-coding (Extended Abstract) Proceedings of the eighth annual ACM symposium on Theory of computing, (211-219)
- Paul W, Tarjan R and Celoni J Space bounds for a game on graphs Proceedings of the eighth annual ACM symposium on Theory of computing, (149-160)
- Katz S and Manna Z (1976). Logical analysis of programs, Communications of the ACM, 19:4, (188-206), Online publication date: 1-Apr-1976.
- Tê T An heuristic model for analysis of memory use under static partition allocation strategies Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation, (272-281)
- Lawson H and Doucette D (1976). A translation machine with automated top-down parsing, ACM SIGPLAN Notices, 11:2, (20-29), Online publication date: 1-Feb-1976.
- Meinke J and Bauer C (1976). The IIT MST in computer science program, ACM SIGCUE Outlook, 10:SI, (35-38), Online publication date: 1-Feb-1976.
- Meinke J and Bauer C (1976). The IIT MST in computer science program, ACM SIGCSE Bulletin, 8:1, (35-38), Online publication date: 1-Feb-1976.
- Meinke J and Bauer C The IIT MST in computer science program Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education, (35-38)
- Agrawala A and Bryant R Models of memory scheduling Proceedings of the fifth ACM symposium on Operating systems principles, (217-222)
- Bitner J and Reingold E (1975). Backtrack programming techniques, Communications of the ACM, 18:11, (651-656), Online publication date: 1-Nov-1975.
- Agrawala A and Bryant R (1975). Models of memory scheduling, ACM SIGOPS Operating Systems Review, 9:5, (217-222), Online publication date: 1-Nov-1975.
- Schroeder J, Kiefer W, Guertin R and Berman W Stanford's generalized database system Proceedings of the 1st International Conference on Very Large Data Bases, (120-143)
- Bentley J (1975). Multidimensional binary search trees used for associative searching, Communications of the ACM, 18:9, (509-517), Online publication date: 1-Sep-1975.
- Steele G (1975). Multiprocessing compactifying garbage collection, Communications of the ACM, 18:9, (495-508), Online publication date: 1-Sep-1975.
- Smith A (1975). Comments on a paper by T.C. Chen and I.T. Ho, Communications of the ACM, 18:8, (463), Online publication date: 1-Aug-1975.
- Shore J (1975). On the external storage fragmentation produced by first-fit and best-fit allocation strategies, Communications of the ACM, 18:8, (433-440), Online publication date: 1-Aug-1975.
- Zahn C (1975). Structured control in programming languages, ACM SIGPLAN Notices, 10:7, (13-15), Online publication date: 1-Jul-1975.
- Hartman L Edge-labeled directed graphs in APL Proceedings of seventh international conference on APL, (181-187)
- London R (1975). A view of program verification, ACM SIGPLAN Notices, 10:6, (534-545), Online publication date: 1-Jun-1975.
- Laventhal M (1975). Verifying programs which operate on data structures, ACM SIGPLAN Notices, 10:6, (420-426), Online publication date: 1-Jun-1975.
- Soule S (1975). Addition in an arbitrary base without radix conversion, Communications of the ACM, 18:6, (344-346), Online publication date: 1-Jun-1975.
- Bandurski A and Jefferson D Data description for computer-aided design Proceedings of the 1975 ACM SIGMOD international conference on Management of data, (193-202)
- Lipton R, Eisenstat S and DeMillo R The complexity of control structures and data structures Proceedings of the seventh annual ACM symposium on Theory of computing, (186-193)
- Rosenberg A and Stockmeyer L Hashing schemes for extendible arrays (Extended Abstract) Proceedings of the seventh annual ACM symposium on Theory of computing, (159-166)
- London R A view of program verification Proceedings of the international conference on Reliable software, (534-545)
- Laventhal M Verifying programs which operate on data structures Proceedings of the international conference on Reliable software, (420-426)
- Matelan M (1975). MPACT, ACM SIGDA Newsletter, 5:1, (13-41), Online publication date: 1-Mar-1975.
- Honkanen P (1975). Setting the foundations of computer science in a business oriented program, ACM SIGCSE Bulletin, 7:1, (187-190), Online publication date: 1-Feb-1975.
- Gerhart S (1975). Methods for teaching program verification, ACM SIGCSE Bulletin, 7:1, (172-178), Online publication date: 1-Feb-1975.
- Ripley G (1975). A course in effective programming, ACM SIGCSE Bulletin, 7:1, (102-108), Online publication date: 1-Feb-1975.
- Lechner R Sequentially encoded data structures that support bidirectional scanning Proceedings of the 2nd annual symposium on Computer architecture, (188-194)
- Berkling K Reduction languages for reduction machines Proceedings of the 2nd annual symposium on Computer architecture, (133-140)
- Lomet D (1975). Scheme for invalidating references to freed storage, IBM Journal of Research and Development, 19:1, (26-35), Online publication date: 1-Jan-1975.
- Purdy J (1975). A graduate course in database management, ACM SIGMOD Record, 7:1, (10-15), Online publication date: 1-Jan-1975.
- Claybrook B (1973). FOL, ACM SIGPLAN Notices, 10:1, (101-112), Online publication date: 1-Jan-1975.
- Honkanen P Setting the foundations of computer science in a business oriented program Proceedings of the fifth SIGCSE technical symposium on Computer science education, (187-190)
- Gerhart S Methods for teaching program verification Proceedings of the fifth SIGCSE technical symposium on Computer science education, (172-178)
- Ripley G A course in effective programming Proceedings of the fifth SIGCSE technical symposium on Computer science education, (102-108)
- Fletcher J No! high level languages should not be used to write systems software Proceedings of the 1975 annual conference, (209-211)
- Lester B Program schemas with concurrency Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (185-193)
- Kennedy K Node listings applied to data flow analysis Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (10-21)
- Claybrook B (1973). FOL, ACM SIGIR Forum, 9:3, (101-112), Online publication date: 31-Dec-1975.
- Shneiderman B (1974). Opportunities for data base reorganization, ACM SIGMOD Record, 6:4, (1-8), Online publication date: 1-Dec-1974.
- Korfhage R (1974). On the development of data structures, ACM SIGPLAN Notices, 9:12, (14-23), Online publication date: 1-Dec-1974.
- Lechner R (1974). Sequentially encoded data structures that support bidirectional scanning, ACM SIGARCH Computer Architecture News, 3:4, (188-194), Online publication date: 1-Dec-1974.
- Berkling K (1974). Reduction languages for reduction machines, ACM SIGARCH Computer Architecture News, 3:4, (133-140), Online publication date: 1-Dec-1974.
- Kimbleton S (1974). Batch computer scheduling, ACM SIGMETRICS Performance Evaluation Review, 3:4, (189-198), Online publication date: 1-Dec-1974.
- Knott G (1974). A proposal for certain process management and intercommunication primitives, ACM SIGOPS Operating Systems Review, 8:4, (7-44), Online publication date: 1-Oct-1974.
- Shen K and Peterson J (1974). A weighted buddy method for dynamic storage allocation, Communications of the ACM, 17:10, (558-562), Online publication date: 1-Oct-1974.
- Maurer W Some correctness principles for machine language programs and microprograms Conference record of the 7th annual workshop on Microprogramming, (225-234)
- Bray D (1974). Dynamic storage routines for Fortran programs, ACM SIGPLAN Notices, 9:9, (2-13), Online publication date: 1-Sep-1974.
- Evans A, Kantrowitz W and Weiss E (1974). A user authentication scheme not requiring secrecy in the computer, Communications of the ACM, 17:8, (437-442), Online publication date: 1-Aug-1974.
- Moses J (1974). MACSYMA - the fifth year, ACM SIGSAM Bulletin, 8:3, (105-110), Online publication date: 1-Aug-1974.
- Lecarme O (1974). Structured programming, programming teaching and the language Pascal, ACM SIGPLAN Notices, 9:7, (15-21), Online publication date: 1-Jul-1974.
- Cohen J and Zuckerman C (1974). Two languages for estimating program efficiency, Communications of the ACM, 17:6, (301-308), Online publication date: 1-Jun-1974.
- Stonebraker M A functional view of data independence Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control, (63-81)
- Wunderlich M and Selfridge J (1974). A design for a number theory package with an optimized trial division routine, Communications of the ACM, 17:5, (272-276), Online publication date: 1-May-1974.
- Rosenberg A Managing storage for extendible arrays (Extended Abstract) Proceedings of the sixth annual ACM symposium on Theory of computing, (297-302)
- Hyafil L, Prusker F and Vuillemin J An efficient algorithm for computing optimal disk merge patterns. (Extended Abstract) Proceedings of the sixth annual ACM symposium on Theory of computing, (216-229)
- Goldsmith C (1974). The design of a procedureless programming language, ACM SIGPLAN Notices, 9:4, (13-24), Online publication date: 1-Apr-1974.
- Abraham P (1974). Some remarks on lookup of structured variables, Communications of the ACM, 17:4, (209-210), Online publication date: 1-Apr-1974.
- Goldsmith C The design of a procedureless programming language Proceedings of the ACM SIGPLAN symposium on Very high level languages, (13-24)
- Barrett R and Jordan B (1974). Scan conversion algorithms for a cell organized raster display, Communications of the ACM, 17:3, (157-163), Online publication date: 1-Mar-1974.
- Balkovich E, Chiu W, Presser L and Wood R (1974). Dynamic memory repacking, Communications of the ACM, 17:3, (133-138), Online publication date: 1-Mar-1974.
- Tremblay J and Manohar R (1974). A first course in discrete structures with applications to computer science, ACM SIGCSE Bulletin, 6:1, (155-160), Online publication date: 1-Feb-1974.
- Thomas R (1974). Computer architecture in the computer science curriculum, ACM SIGCSE Bulletin, 6:1, (116-120), Online publication date: 1-Feb-1974.
- Kimbleton S Batch computer scheduling Proceedings of the 1974 ACM SIGMETRICS conference on Measurement and evaluation, (189-198)
- D'Dell M and Thompson J APL\XAD Proceedings of the sixth international conference on APL, (405-413)
- Tremblay J and Manohar R A first course in discrete structures with applications to computer science Proceedings of the fourth SIGCSE technical symposium on Computer science education, (155-160)
- Thomas R Computer architecture in the computer science curriculum Proceedings of the fourth SIGCSE technical symposium on Computer science education, (116-120)
- Housel B and Halstead M A methodology for machine language decompilation Proceedings of the 1974 annual conference - Volume 1, (254-260)
- Klip D The variable cell length listprocessor VARLIST Proceedings of the 1974 annual conference - Volume 1, (128-132)
- Knott G (1974). A numbering system for combinations, Communications of the ACM, 17:1, (45-46), Online publication date: 1-Jan-1974.
- Gibbs N and Poole W (1974). Tridiagonalization by permutations, Communications of the ACM, 17:1, (20-24), Online publication date: 1-Jan-1974.
- Couger J (1973). Curriculum recommendations for undergraduate programs in information systems, Communications of the ACM, 16:12, (727-749), Online publication date: 1-Dec-1973.
- Claybrook B FOL Proceedings of the 1973 meeting on Programming languages and information retrieval, (101-112)
- Brenner N (1973). Algorithm 467: matrix transposition in place [F1], Communications of the ACM, 16:11, (692-694), Online publication date: 1-Nov-1973.
- Brenner N (1973). Algorithm 467: Matrix Transposition in Place, Communications of the ACM, 16:11, (692-694), Online publication date: 1-Nov-1973.
- Rosenberg A Transitions in extendible arrays Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (218-225)
- Waldinger R and Levitt K Reasoning about programs Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (169-182)
- Hirschberg D (1973). A class of dynamic memory allocation algorithms, Communications of the ACM, 16:10, (615-618), Online publication date: 1-Oct-1973.
- Bobrow D and Wegbreit B (1973). A model and stack implementation of multiple environments, Communications of the ACM, 16:10, (591-603), Online publication date: 1-Oct-1973.
- Morris J (1973). Programming by semantic refinement, ACM SIGPLAN Notices, 8:9, (120-122), Online publication date: 1-Sep-1973.
- Bays C The reallocation of sequential regions of non-uniform size Proceedings of the ACM annual conference, (444.5-445)
- Goodman S, Hardy S and Vitt L Simulation experiments into inventory scheduling in multi-stage systems Proceedings of the ACM annual conference, (444.1-445)
- Huebner P, Skelton D and Schweppe E Interactive instruction simulation on and of the Datapoint 2200 computer Proceedings of the ACM annual conference, (304-308)
- Smith M (1973). A learning program which plays partnership dominoes, Communications of the ACM, 16:8, (462-467), Online publication date: 1-Aug-1973.
- Rosin R (1973). Teaching “about programming”, Communications of the ACM, 16:7, (435-439), Online publication date: 1-Jul-1973.
- Huang J (1973). A note on information organization and storage, Communications of the ACM, 16:7, (406-410), Online publication date: 1-Jul-1973.
- Reingold E (1973). A nonrecursive list moving algorithm, Communications of the ACM, 16:5, (305-307), Online publication date: 1-May-1973.
- Corneil D, Gotlieb C and Lee Y (1973). Minimal event-node network of project precedence relations, Communications of the ACM, 16:5, (296-298), Online publication date: 1-May-1973.
- Aho A, Hopcroft J and Ullman J On finding lowest common ancestors in trees Proceedings of the fifth annual ACM symposium on Theory of computing, (253-265)
- Miller W Toward mechanical verification of properties of roundoff error propagation Proceedings of the fifth annual ACM symposium on Theory of computing, (50-58)
- Engel G (1973). A computer science course program for small colleges, Communications of the ACM, 16:3, (139-147), Online publication date: 1-Mar-1973.
- Walker J and Hughes C (1973). POPSS - a parametric operating system simulator, ACM SIGCSE Bulletin, 5:1, (166-169), Online publication date: 1-Feb-1973.
- Beidler J (1973). A machine independent course in processor organization and assembler language programming, ACM SIGCSE Bulletin, 5:1, (149-152), Online publication date: 1-Feb-1973.
- Yeh R, Good D and Musser D (1973). New directions in teaching the fundamentals of computer science — discrete structures and computational analysis, ACM SIGCSE Bulletin, 5:1, (60-67), Online publication date: 1-Feb-1973.
- Fuller S Performance of an I/O channel with multiple paging drums Proceedings of the 1973 ACM SIGME symposium, (13-21)
- Morris J Programming by semantic refinement Proceeding of ACM SIGPLAN - SIGOPS interface meeting on Programming languages - operating systems, (120-122)
- Walker J and Hughes C POPSS - a parametric operating system simulator Proceedings of the third SIGCSE technical symposium on Computer science education, (166-169)
- Beidler J A machine independent course in processor organization and assembler language programming Proceedings of the third SIGCSE technical symposium on Computer science education, (149-152)
- Yeh R, Good D and Musser D New directions in teaching the fundamentals of computer science — discrete structures and computational analysis Proceedings of the third SIGCSE technical symposium on Computer science education, (60-67)
- Bayer R (1972). Symmetric binary B-Trees, Acta Informatica, 1:4, (290-306), Online publication date: 1-Dec-1972.
- Morris J and Wells M (1972). The specification of program flow in Madcap 6, ACM SIGPLAN Notices, 7:11, (28-35), Online publication date: 1-Nov-1972.
- Fisher D (1972). A survey of control structures in programming languages, ACM SIGPLAN Notices, 7:11, (1-13), Online publication date: 1-Nov-1972.
- Morris J (1972). Demand paging through utilization of working sets onr the MANIAC II, Communications of the ACM, 15:10, (867-872), Online publication date: 1-Oct-1972.
- Horowitz E The application of symbolic mathematics to a singular perturbation problem Proceedings of the ACM annual conference - Volume 2, (816-825)
- Engelman C and Kleinman A Machine-made analytic solutions of finite state Markov processes Proceedings of the ACM annual conference - Volume 2, (801-815)
- Morris J and Wells M The specification of program flow in Madcap 6 Proceedings of the ACM annual conference - Volume 2, (755-762)
- Kershenbaum A and Van Slyke R Computing minimum spanning trees efficiently Proceedings of the ACM annual conference - Volume 1, (518-527)
- Greenawalt E and Good D The MIX computer as an educational tool Proceedings of the ACM annual conference - Volume 1, (302-309)
- Moses J (1972). Towards a general theory of special functions, Communications of the ACM, 15:7, (550-554), Online publication date: 1-Jul-1972.
- Traub J (1972). Numerical mathematics and computer science, Communications of the ACM, 15:7, (537-541), Online publication date: 1-Jul-1972.
- Loos R (1972). Algebraic algorithm descriptions as programs, ACM SIGSAM Bulletin:23, (16-24), Online publication date: 1-Jul-1972.
- Schuler D and Ulrich E Clustering and linear placement Proceedings of the 9th Design Automation Workshop, (50-56)
- Ogden W and Rounds W Compositions of n tree transducers Proceedings of the fourth annual ACM symposium on Theory of computing, (198-206)
- Parnas D (1972). A course on software engineering techniques, ACM SIGCSE Bulletin, 4:1, (154-159), Online publication date: 1-Mar-1972.
- Caviness B and Collins G (1972). Symbolic mathematical computation in a Ph. D. computer science program, ACM SIGCSE Bulletin, 4:1, (19-23), Online publication date: 1-Mar-1972.
- Engel G and Barnes B (1972). The effect of environment on computer science curriculum, ACM SIGCSE Bulletin, 4:1, (13-18), Online publication date: 1-Mar-1972.
- Mathis R and Kerr D (1972). Development of a multifacetted undergraduate program in computer and information science, ACM SIGCSE Bulletin, 4:1, (8-12), Online publication date: 1-Mar-1972.
- Parnas D A course on software engineering techniques Proceedings of the second SIGCSE technical symposium on Education in computer science, (154-159)
- Caviness B and Collins G Symbolic mathematical computation in a Ph.D. computer science program Proceedings of the second SIGCSE technical symposium on Education in computer science, (19-23)
- Engel G and Barnes B The effect of environment on computer science curriculum Proceedings of the second SIGCSE technical symposium on Education in computer science, (13-18)
- Mathis R and Kerr D Development of a multifacetted undergraduate program in Computer and Information Science Proceedings of the second SIGCSE technical symposium on Education in computer science, (8-12)
- Martin W and Ness D (1972). Optimizing binary trees grown with a sorting algorithm, Communications of the ACM, 15:2, (88-93), Online publication date: 1-Feb-1972.
- Wegner P Operational semantics of programming languages Proceedings of ACM conference on Proving assertions about programs, (128-141)
- Wegner P (1972). Operational semantics of programming languages, ACM SIGACT News:14, (128-141), Online publication date: 1-Jan-1972.
- Wegner P (1972). Operational semantics of programming languages, ACM SIGPLAN Notices, 7:1, (128-141), Online publication date: 1-Jan-1972.
- Nievergelt J Binary search trees and file organization Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control, (165-187)
- Austing R and Engel G Computer science education in small colleges - a report with recommendations Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers, (62-71)
- Rochfeld A (1971). New LISP techniques for a paging environment, Communications of the ACM, 14:12, (791-795), Online publication date: 1-Dec-1971.
- Hu T (1971). Some problems in discrete optimization, Mathematical Programming: Series A and B, 1:1, (102-112), Online publication date: 1-Dec-1971.
- Varney R Process selection in a hierarchical operating system Proceedings of the third ACM symposium on Operating systems principles, (106-108)
- Rabin J (1971). Conversion of limited-entry decision tables into optimal decision trees, ACM SIGPLAN Notices, 6:8, (68-74), Online publication date: 1-Sep-1971.
- Amarel S (1971). Computer science, Communications of the ACM, 14:6, (391-401), Online publication date: 1-Jun-1971.
- Knott G A balanced tree storage and retrieval algorithm Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval, (175-196)
- Hunt E and Kildall G A heathkit method for building data management programs Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval, (117-131)
- McClellan M The exact solution of systems of linear equations with polynomial coefficients Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, (399-414)
- Collins G The calculation of multivariate polynomial resultants Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, (212-222)
- Horowitz E Modular arithmetic and finite field theory Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, (188-194)
- Collins G The SAC-1 system Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, (144-152)
- Gelenbe E (1971). The two-thirds rule for dynamic storage allocation under equilibrium, Information Processing Letters, 1:2, (59-60), Online publication date: 1-Jan-1971.
- Tiernan J (1970). An efficient search algorithm to find the elementary circuits of a graph, Communications of the ACM, 13:12, (722-726), Online publication date: 1-Dec-1970.
- Baecker H (1970). Implementing the ALGOL 68 heap, BIT, 10:4, (405-414), Online publication date: 1-Dec-1970.
- Sibley E and Taylor R Preliminary discussion of a general data-to-storage structure mapping language Proceedings of the 1970 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control, (368-380)
- Wegner P (1970). Some thoughts on graduate education in computer science, ACM SIGCSE Bulletin, 2:4, (30-40), Online publication date: 2-Nov-1970.
- Cheney C (1970). A nonrecursive list compacting algorithm, Communications of the ACM, 13:11, (677-678), Online publication date: 1-Nov-1970.
- Seppänen J (1970). Algorithm 399: Spanning tree, Communications of the ACM, 13:10, (621-622), Online publication date: 1-Oct-1970.
- Hill G (1970). Algorithm 396: Student's t-Quantiles, Communications of the ACM, 13:10, (619-620), Online publication date: 1-Oct-1970.
- Hill G (1970). ACM Algorithm 395: Student's t-distribution, Communications of the ACM, 13:10, (617-619), Online publication date: 1-Oct-1970.
- Coffman E and Eve J (1970). File structures using hashing functions, Communications of the ACM, 13:7, (427-432), Online publication date: 1-Jul-1970.
- Engel G (1970). Computer science education in small colleges, ACM SIGCSE Bulletin, 2:2, (14-30), Online publication date: 1-Jun-1970.
- London R (1970). Certification of algorithm 245 [M1]:treesort 3:proof of algorithms—a new kind of certification, Communications of the ACM, 13:6, (371-373), Online publication date: 1-Jun-1970.
- Rosenberg A Data graphs and addressing schemes (Extended Abstract) Proceedings of the second annual ACM symposium on Theory of computing, (48-61)
- Ness D, Green R and Martin W (1970). Computer education in a graduate school of management, Communications of the ACM, 13:2, (110-114), Online publication date: 1-Feb-1970.
- Khan B, Heinz C and Koch A The Open-Source DeLiBA2 Hardware/Software Framework for Distributed Storage Accelerators, ACM Transactions on Reconfigurable Technology and Systems, 0:0
- D'Imperio M (1969). Information structures, ACM SIGMOD Record, 1:2, (25-51), Online publication date: 1-Dec-1969.
- Gosden J (1969). Report to X3 on data definition languages, ACM SIGMOD Record, 1:2, (14-25), Online publication date: 1-Dec-1969.
- Forsythe G (1969). Syllabi and qualifying examinations for the Ph. D. in computer science at Stanford University, ACM SIGCSE Bulletin, 1:4, (25-34), Online publication date: 1-Dec-1969.
- Edmundson H and Epstein M Computer-aided research on synonymy and antonymy Proceedings of the 1969 conference on Computational linguistics, (1-22)
- Yang S A search algorithm and data structure for an efficient information system Proceedings of the 1969 conference on Computational linguistics, (1-48)
- Hansen W (1969). Compact list representation, Communications of the ACM, 12:9, (499-507), Online publication date: 1-Sep-1969.
- Chapin N A comparison of file organization techniques Proceedings of the 1969 24th national conference, (273-283)
- Kain R (1969). Block structures, indirect addressing, and garbage collection, Communications of the ACM, 12:7, (395-398), Online publication date: 1-Jul-1969.
- Randell B (1969). A note on storage fragmentation and program segmentation, Communications of the ACM, 12:7, (365-ff.), Online publication date: 1-Jul-1969.
- Fischler M and Reiter A Variable topology random access memory organizations Proceedings of the May 14-16, 1969, spring joint computer conference, (381-391)
- Salton G (1969). Information science in a Ph.D. computer science program, Communications of the ACM, 12:2, (111-117), Online publication date: 1-Feb-1969.
- Atchison W, Conte S, Hamblen J, Hull T, Keenan T, Kehl W, McCluskey E, Navarro S, Rheinboldt W, Schweppe E, Viavant W and Young D (1968). Curriculum 68: Recommendations for academic programs in computer science, Communications of the ACM, 11:3, (151-197), Online publication date: 1-Mar-1968.
Index Terms
- The art of computer programming, volume 1 (3rd ed.): fundamental algorithms