Skip header Section
Skip Bibliometrics Section
Algorithms + Data Structures = ProgramsApril 1978
- Author:
- Niklaus Wirth
Abstract
No abstract available.
Cited By
- Rosenbloom P Thoughts on Architecture Artificial General Intelligence, (364-373)
- Ruzankin P (2022). A Fast Parallelizable Algorithm for Constructing Balanced Binary Search Trees, SN Computer Science, 3:5, Online publication date: 4-Aug-2022.
- Gómez De Silva Garza A (2019). An introduction to and comparison of computational creativity and design computing, Artificial Intelligence Review, 51:1, (61-76), Online publication date: 1-Jan-2019.
- Myers D and Chatlani N (2017). Implementing an adaptive tutorial system for coding literacy, Journal of Computing Sciences in Colleges, 33:2, (260-267), Online publication date: 1-Dec-2017.
- Ageev A, Kel'manov A, Pyatkin A, Khamidullin S and Shenmaier V (2017). Approximation polynomial algorithm for the data editing and data cleaning problem, Pattern Recognition and Image Analysis, 27:3, (365-370), Online publication date: 1-Jul-2017.
Erkan A and Barr J Algorithms + Organization = Systems Proceedings of the 2016 ACM Conference on Innovation and Technology in Computer Science Education, (65-70)- Coullon H and Limet S (2016). The SIPSim implicit parallelism model and the SkelGIS library, Concurrency and Computation: Practice & Experience, 28:7, (2120-2144), Online publication date: 1-May-2016.
- Pottier F Reachability and error diagnosis in LR(1) parsers Proceedings of the 25th International Conference on Compiler Construction, (88-98)
- Wirth M A Descent into the Maelstrom Proceedings of the 46th ACM Technical Symposium on Computer Science Education, (156-161)
- Taft S (2013). Bringing safe, dynamic parallel programming to the spark verifiable subset of ada, ACM SIGAda Ada Letters, 33:3, (37-40), Online publication date: 29-Nov-2013.
- Taft S Bringing safe, dynamic parallel programming to the spark verifiable subset of ada Proceedings of the 2013 ACM SIGAda annual conference on High integrity language technology, (37-40)
- Demaille A, Duret-Lutz A, Lombardy S and Sakarovitch J Implementation concepts in vaucanson 2 Proceedings of the 18th international conference on Implementation and Application of Automata, (122-133)
- Ye C, Yoon Y and Jacobsen H Service subscription and consumption for personal web applications The Personal Web, (49-64)
- Monteiro P, Monteiro M and Pingali K Parallelizing irregular algorithms Proceedings of the 18th Conference on Pattern Languages of Programs, (1-18)
- Jung C, Rus S, Railing B, Clark N and Pande S Brainy Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, (86-97)
- Pingali K, Nguyen D, Kulkarni M, Burtscher M, Hassaan M, Kaleem R, Lee T, Lenharth A, Manevich R, Méndez-Lojo M, Prountzos D and Sui X The tao of parallelism in algorithms Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, (12-25)
- Jung C, Rus S, Railing B, Clark N and Pande S (2019). Brainy, ACM SIGPLAN Notices, 46:6, (86-97), Online publication date: 4-Jun-2011.
- Pingali K, Nguyen D, Kulkarni M, Burtscher M, Hassaan M, Kaleem R, Lee T, Lenharth A, Manevich R, Méndez-Lojo M, Prountzos D and Sui X (2011). The tao of parallelism in algorithms, ACM SIGPLAN Notices, 46:6, (12-25), Online publication date: 4-Jun-2011.
- Mu S and Oliveira J Programming from galois connections Proceedings of the 12th international conference on Relational and algebraic methods in computer science, (294-313)
- Corsi C, Geist R and Westall J Methods for computing NASCAR tire/track intersections Proceedings of the 49th Annual Southeast Regional Conference, (276-280)
- Duhamel C, Lacomme P, Prins C and Prodhon C (2010). A GRASP×ELS approach for the capacitated location-routing problem, Computers and Operations Research, 37:11, (1912-1923), Online publication date: 1-Nov-2010.
- Gondow K, Fukuyasu N and Arahori Y MieruCompiler Proceedings of the 41st ACM technical symposium on Computer science education, (7-11)
- Gu L and Cheung S Constructing and testing privacy-aware services in a cloud computing environment Proceedings of the First Asia-Pacific Symposium on Internetware, (1-10)
- Guo D (2008). Regionalization with dynamically constrained agglomerative clustering and partitioning (REDCAP), International Journal of Geographical Information Science, 22:7, (801-823), Online publication date: 1-Jul-2008.
- Caumond A, Lacomme P and Tchernev N (2008). A memetic algorithm for the job-shop with time-lags, Computers and Operations Research, 35:7, (2331-2356), Online publication date: 1-Jul-2008.
- Suhonen J, Davies J, Thompson E and Kinshuk Applications of variation theory in computing education Proceedings of the Seventh Baltic Sea Conference on Computing Education Research - Volume 88, (217-220)
- Kulkarni M, Pingali K, Walter B, Ramanarayanan G, Bala K and Chew L Optimistic parallelism requires abstractions Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation, (211-222)
- Kulkarni M, Pingali K, Walter B, Ramanarayanan G, Bala K and Chew L (2007). Optimistic parallelism requires abstractions, ACM SIGPLAN Notices, 42:6, (211-222), Online publication date: 10-Jun-2007.
- Muller P, Fleurey F and Jézéquel J Weaving executability into object-oriented meta-languages Proceedings of the 8th international conference on Model Driven Engineering Languages and Systems, (264-278)
- Wiles J, Geard N, Watson J, Willadsen K, Mattick J, Bradley D and Hallinan J There's more to a model than code Proceedings of the 7th annual workshop on Genetic and evolutionary computation, (281-288)
- Glynn E, Hayes I and MacDonald A Integration of generic program analysis tools into a software development environment Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38, (249-257)
- Briggs P, Cooper K, Kennedy K and Torczon L (2004). Coloring heuristics for register allocation, ACM SIGPLAN Notices, 39:4, (283-294), Online publication date: 1-Apr-2004.
- Guru D, Punitha P and Nagabhushan P (2003). Archival and retrieval of symbolic images, Pattern Recognition Letters, 24:14, (2397-2408), Online publication date: 1-Oct-2003.
- Jones C (2018). The Early Search for Tractable Ways of Reasoning about Programs, IEEE Annals of the History of Computing, 25:2, (26-49), Online publication date: 1-Apr-2003.
- Shneiderman B Data type Encyclopedia of Computer Science, (512-513)
- Hopcroft J and Rus D Algorithms, analysis of Encyclopedia of Computer Science, (42-45)
- Stephens D and Gaskell C "Ceci n'est pas une pipe" Proceedings of the Fourth International Workshop on Web Site Evolution (WSE'02)
- Zongyan Q (2002). Bit-vector encoding of n-queen problem, ACM SIGPLAN Notices, 37:2, (68-70), Online publication date: 1-Feb-2002.
- Tseitlin G (2019). The Problem of Functional Completeness of Metaalgebras of Regular Events, Cybernetics and Systems Analysis, 36:6, (802-812), Online publication date: 1-Nov-2000.
- Bondi A Characteristics of scalability and their impact on performance Proceedings of the 2nd international workshop on Software and performance, (195-203)
- Noonan R An object-oriented view of backtracking Proceedings of the thirty-first SIGCSE technical symposium on Computer science education, (362-366)
- Noonan R (2000). An object-oriented view of backtracking, ACM SIGCSE Bulletin, 32:1, (362-366), Online publication date: 1-Mar-2000.
- Malerba J and Murthy N An optimal search tree Proceedings of the 36th annual Southeast regional conference, (173-177)
- Jiazhong Z, Yanbing W and Mingchun Z (1997). Design and static semantics of algorithm languageL, ACM SIGPLAN Notices, 32:11, (57-64), Online publication date: 1-Nov-1997.
- Utgoff P, Berkman N and Clouse J (2019). Decision Tree Induction Based on Efficient Tree Restructuring, Machine Language, 29:1, (5-44), Online publication date: 1-Oct-1997.
- Gersting J and Young F (1997). Content + experiences = curriculum, ACM SIGCSE Bulletin, 29:1, (325-329), Online publication date: 1-Mar-1997.
- Gersting J and Young F Content + experiences = curriculum Proceedings of the twenty-eighth SIGCSE technical symposium on Computer science education, (325-329)
- Wolz U, Weisgarber S, Domen D and McAuliffe M (1996). Teaching introductory programming in the multi-media world, ACM SIGCSE Bulletin, 28:SI, (57-59), Online publication date: 2-Jun-1996.
- Wolz U, Weisgarber S, Domen D and McAuliffe M Teaching introductory programming in the multi-media world Proceedings of the 1st conference on Integrating technology into computer science education, (57-59)
- Wolz U, Weisgarber S, Domen D and McAuliffe M (1996). Teaching introductory programming in the multi-media world, ACM SIGCUE Outlook, 24:1-3, (57-59), Online publication date: 1-Jan-1996.
- Maelbrancke R and Olivié H (2019). Optimizing Jan Jannink's Implementation of B+-tree deletion, ACM SIGMOD Record, 24:3, (5-7), Online publication date: 1-Sep-1995.
- Jannink J (2019). Implementing deletion in B+-trees, ACM SIGMOD Record, 24:1, (33-38), Online publication date: 1-Mar-1995.
- Luker P (1994). There's more to OOP than syntax!, ACM SIGCSE Bulletin, 26:1, (56-60), Online publication date: 12-Mar-1994.
- Luker P There's more to OOP than syntax! Proceedings of the twenty-fifth SIGCSE symposium on Computer science education, (56-60)
- Lee Y and Conjura E First step to Forth engine construction Proceedings of the fourth annual workshop on Forth: from the classroom to the real world, (12-16)
- Lee Y and Conjura E (1993). First step to Forth engine construction, ACM SIGFORTH Newsletter, 4:3, (12-16), Online publication date: 1-Dec-1993.
- Kumar P Language support for data parallelism in pointer based dynamic data structures Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2, (933-941)
- Mohan L and Kashyap R (2018). A Visual Query Language for Graphical Interaction with Schema-Intensive Databases, IEEE Transactions on Knowledge and Data Engineering, 5:5, (843-858), Online publication date: 1-Oct-1993.
- Ching W and Katz A (1993). The testing of an APL compiler, ACM SIGAPL APL Quote Quad, 24:1, (55-62), Online publication date: 1-Sep-1993.
- Ching W and Katz A The testing of an APL compiler Proceedings of the international conference on APL, (55-62)
- Gray J (1993). Is eight enough?, ACM SIGCSE Bulletin, 25:3, (39-44), Online publication date: 1-Sep-1993.
- Dayal U, Garcia-Molina H, Hsu M, Kao B and Shan M (2019). Third generation TP monitors, ACM SIGMOD Record, 22:2, (393-397), Online publication date: 1-Jun-1993.
- Dayal U, Garcia-Molina H, Hsu M, Kao B and Shan M Third generation TP monitors Proceedings of the 1993 ACM SIGMOD international conference on Management of data, (393-397)
- Casimir R (1992). Real programmers don't use spreadsheets, ACM SIGPLAN Notices, 27:6, (10-16), Online publication date: 1-Jun-1992.
- Elsworth E (1992). The MSL compiler writing project, ACM SIGCSE Bulletin, 24:2, (41-44), Online publication date: 1-Jun-1992.
- van den Bosch P (1992). A bibliography on syntax error handling in context free languages, ACM SIGPLAN Notices, 27:4, (77-86), Online publication date: 1-Apr-1992.
- Krauser E, Mathur A and Rego V (2019). High Performance Software Testing on SIMD Machines, IEEE Transactions on Software Engineering, 17:5, (403-423), Online publication date: 1-May-1991.
- Dobler H (1991). Top-down parsing in Coco-2, ACM SIGPLAN Notices, 26:3, (79-87), Online publication date: 2-Jan-1991.
- Iseli C and Sanchez E A high-level microprogrammed processor Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture, (244-251)
- Pair C (2018). GRIN, IEEE Annals of the History of Computing, 12:3, (159-166), Online publication date: 1-Jul-1990.
- Pugh W (1990). Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, 33:6, (668-676), Online publication date: 1-Jun-1990.
- Murthy N An optimal search tree Proceedings of the 17th conference on ACM Annual Computer Science Conference, (404-404)
- Armenise P (2019). A structured approach to program optimization, IEEE Transactions on Software Engineering, 15:2, (101-108), Online publication date: 1-Feb-1989.
- Guigó R and Ocaña J (1988). An interactive support software for design and use of simulation packages, Mathematical and Computer Modelling: An International Journal, 11, (1205-1207), Online publication date: 31-Dec-1988.
- Salenieks P and Naylor J (1988). Professional skills assessment in programming competitions, ACM SIGCSE Bulletin, 20:4, (9-14), Online publication date: 1-Dec-1988.
- Roth P and Brown R CONVERSIM Proceedings of the 20th conference on Winter simulation, (878-886)
- Davidson C (2019). Quicksort Revisited, IEEE Transactions on Software Engineering, 14:10, (1480-1481), Online publication date: 1-Oct-1988.
- Jones D (1988). How (not) to code a finite state machine, ACM SIGPLAN Notices, 23:8, (19-22), Online publication date: 1-Aug-1988.
- Andrews K, Henry R and Yamamoto W (2019). Design and implementation of the UW Illustrated compiler, ACM SIGPLAN Notices, 23:7, (105-114), Online publication date: 1-Jul-1988.
- Andrews K, Henry R and Yamamoto W Design and implementation of the UW Illustrated compiler Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation, (105-114)
- Rudolph B (1988). Spin-out: the Chinese rings in the classroom, ACM SIGCSE Bulletin, 20:1, (279-282), Online publication date: 1-Feb-1988.
- Rudolph B Spin-out: the Chinese rings in the classroom Proceedings of the nineteenth SIGCSE technical symposium on Computer science education, (279-282)
- Musser D and Stepanov A A library of generic algorithms in Ada Proceedings of the 1987 annual ACM SIGAda international conference on Ada, (216-225)
- Jonsson D (1987). Pancode and boxcharts: structured programming revisited, ACM SIGPLAN Notices, 22:8, (89-98), Online publication date: 1-Aug-1987.
- Parker J (1987). A study of record packing methods, ACM SIGPLAN Notices, 22:3, (71-77), Online publication date: 1-Mar-1987.
- Chu I and Johnsonbaugh R Tiling and recursion Proceedings of the eighteenth SIGCSE technical symposium on Computer science education, (261-263)
- Chu I and Johnsonbaugh R (1987). Tiling and recursion, ACM SIGCSE Bulletin, 19:1, (261-263), Online publication date: 1-Feb-1987.
- Clapp R, Mudge T and Volz R (1986). Solutions to the n Queens problem using tasking in Ada, ACM SIGPLAN Notices, 21:12, (99-110), Online publication date: 1-Dec-1986.
- Abramson B and Yung M Construction through decomposition Proceedings of 1986 ACM Fall joint computer conference, (620-628)
- van Eijk P (1986). A useful application of formal procedure parameters, ACM SIGPLAN Notices, 21:9, (77-78), Online publication date: 1-Sep-1986.
- Sathi H A project-based course in compiler construction Proceedings of the seventeenth SIGCSE technical symposium on Computer science education, (114-119)
- Sathi H (1986). A project-based course in compiler construction, ACM SIGCSE Bulletin, 18:1, (114-119), Online publication date: 1-Feb-1986.
- Early G and Stanat D (1985). Chinese Rings and recursion, ACM SIGCSE Bulletin, 17:4, (69-82), Online publication date: 1-Dec-1985.
- Mielke B (1985). A course in computer graphics, ACM SIGCSE Bulletin, 17:3, (42-43), Online publication date: 1-Sep-1985.
- Dershowitz N (1985). Program abstraction and instantiation, ACM Transactions on Programming Languages and Systems, 7:3, (446-477), Online publication date: 1-Jul-1985.
- Rudnicki P (1985). On the organization of Pascal blocks, ACM SIGPLAN Notices, 20:6, (47-55), Online publication date: 1-Jun-1985.
- Molnár L, Návrat P and Šafařík J (1985). The programming language Pascal (in teaching perspective), ACM SIGPLAN Notices, 20:2, (77-79), Online publication date: 1-Feb-1985.
- Merritt S (1985). An inverted taxonomy of sorting algorithms, Communications of the ACM, 28:1, (96-99), Online publication date: 2-Jan-1985.
- Campbell P and McCabe G (1984). Predicting the success of freshmen in a computer science major, Communications of the ACM, 27:11, (1108-1113), Online publication date: 5-Nov-1984.
- Joseph M (1984). Programming with small blocks, ACM SIGSOFT Software Engineering Notes, 9:5, (28-42), Online publication date: 1-Oct-1984.
- Prabhakar T and Sahasrabuddhe H Towards an Optimal Data-Structure Proceedings of the 10th International Conference on Very Large Data Bases, (235-244)
- Pettorossi A A powerful strategy for deriving efficient programs by transformation Proceedings of the 1984 ACM Symposium on LISP and functional programming, (273-281)
- Johnson R, Krauwer S, Rosner M and Varile G The design of the kernel architecture for the Eurotra software Proceedings of the 10th International Conference on Computational Linguistics and 22nd annual meeting on Association for Computational Linguistics, (226-235)
- Gupta G (1984). Self-assessment procedure XIII, Communications of the ACM, 27:5, (435-443), Online publication date: 1-May-1984.
- Torii K, Sugiyama Y, Morisawa Y and Kasami T Functional programming and logical programming for the telegram analysis problem Proceedings of the 7th international conference on Software engineering, (463-472)
- Rogers W A new program structure to improve accuracy and readability of pascal software Proceedings of the 7th international conference on Software engineering, (454-462)
- Chong K and Hsia P Diagnostic system for distributed software Proceedings of the 7th international conference on Software engineering, (30-40)
- Dupras M, LeMay F and Mili A (1984). Some thoughts on teaching first year programming, ACM SIGCSE Bulletin, 16:1, (148-153), Online publication date: 1-Feb-1984.
- Waguespack L and Hass D (1984). A workbench for project oriented software engineering courses, ACM SIGCSE Bulletin, 16:1, (137-145), Online publication date: 1-Feb-1984.
- Dupras M, LeMay F and Mili A Some thoughts on teaching first year programming Proceedings of the fifteenth SIGCSE technical symposium on Computer science education, (148-153)
- Waguespack L and Hass D A workbench for project oriented software engineering courses Proceedings of the fifteenth SIGCSE technical symposium on Computer science education, (137-145)
- Bongulielmi A and Cellier F (1984). On the usefulness of deterministic grammars for simulation languages, ACM SIGSIM Simulation Digest, 15:1, (14-36), Online publication date: 1-Jan-1984.
- Schaefer M and Patt Y (1983). Improving the performance of UCSD Pascal via microprogramming on the PDP-11/60, ACM SIGMICRO Newsletter, 14:4, (140-148), Online publication date: 1-Dec-1983.
- Winner R and Carter E (1983). Toward type-oriented dynamic vertical migration, ACM SIGMICRO Newsletter, 14:4, (128-139), Online publication date: 1-Dec-1983.
- Hamlet D (1983). Debugging "level", ACM SIGPLAN Notices, 18:8, (4-8), Online publication date: 1-Aug-1983.
- Hamlet D (2019). Debugging "level", ACM SIGSOFT Software Engineering Notes, 8:4, (4-8), Online publication date: 1-Aug-1983.
- Calmet J and di Scala R (1983). Pascal as host language of computer algebra systems, ACM SIGPLAN Notices, 18:7, (15-24), Online publication date: 1-Jul-1983.
- Hamlet D Debugging "level" Proceedings of the symposium on High-level debugging, (4-8)
- Vermaak D (1983). PROGEN, ACM SIGPLAN Notices, 18:3, (46-47), 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)
- 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.
- Hamlet D Debugging “level” Proceedings of the ACM SIGSOFT/SIGPLAN software engineering symposium on High-level debugging, (4-8)
- Zippel M (1982). A parser as a user-interface, driven by an enclosed array., ACM SIGAPL APL Quote Quad, 13:1, (389-396), Online publication date: 1-Sep-1982.
- Mandrioli D (1982). On teaching theoretical foundations of Computer Science, ACM SIGACT News, 14:4, (58-69), Online publication date: 1-Sep-1982.
- di Scala R (1982). SYPAC, ACM SIGSAM Bulletin, 16:3, (7-10), Online publication date: 1-Aug-1982.
- Zippel M A parser as a user-interface, driven by an enclosed array. Proceedings of the international conference on APL, (389-396)
- Ford G (1982). A framework for teaching recursion, ACM SIGCSE Bulletin, 14:2, (32-39), Online publication date: 1-Jun-1982.
- Moffatt D and Moffat P (1982). Eighteen Pascal texts, ACM SIGCSE Bulletin, 14:2, (2-10), Online publication date: 1-Jun-1982.
- Oyang Y and Hsu C Extended LL(k) grammars and parsers Proceedings of the 20th annual Southeast regional conference, (240-245)
- Becker R and Schach S Drawing labelled directed binary graphs on a grid Proceedings of the 20th annual Southeast regional conference, (30-34)
- Kruse R On teaching recursion Proceedings of the thirteenth SIGCSE technical symposium on Computer science education, (92-96)
- Kruse R (1982). On teaching recursion, ACM SIGCSE Bulletin, 14:1, (92-96), Online publication date: 1-Feb-1982.
- Topor R (1982). A note on error recovery in recursive descent parsers, ACM SIGPLAN Notices, 17:2, (37-40), Online publication date: 1-Feb-1982.
- Mili A (1982). Designing software without backtracking, ACM SIGSOFT Software Engineering Notes, 7:1, (77-77), Online publication date: 1-Jan-1982.
- Sassa M (1981). A poor man's realization of recursive structured Fortran, ACM SIGPLAN Notices, 16:5, (43-53), Online publication date: 1-May-1981.
- Futamura Y, Kawai T, Horikoshi H and Tsutsumi M Development of computer programs by problem analysis Diagram(PAD) Proceedings of the 5th international conference on Software engineering, (325-332)
- Azuma M, Takahashi M, Kamiya S and Minomura K Interactive software development tool Proceedings of the 5th international conference on Software engineering, (153-162)
- Merritt S A top down approach to sorting Proceedings of the twelfth SIGCSE technical symposium on Computer science education, (192-195)
- Hanson D (1981). The Y programming language, ACM SIGPLAN Notices, 16:2, (59-68), Online publication date: 1-Feb-1981.
- Merritt S (1981). A top down approach to sorting, ACM SIGCSE Bulletin, 13:1, (192-195), Online publication date: 1-Feb-1981.
- Giacomucci A and Friedman F Capsules Proceedings of the ACM '81 conference, (154-160)
- Shapiro H (1980). The results of an informal study to evaluate the effectiveness of teaching structured programming, ACM SIGCSE Bulletin, 12:4, (50-56), Online publication date: 1-Dec-1980.
- Gordon M and Robinson W Using preliminary Ada in a process control application Proceedings of the May 19-22, 1980, national computer conference, (597-606)
- Moler C Design of an interactive matrix calculator Proceedings of the May 19-22, 1980, national computer conference, (363-368)
- Overmars M and Leeuwen J Dynamically maintaining configurations in the plane (Detailed Abstract) Proceedings of the twelfth annual ACM symposium on Theory of computing, (135-145)
- Burris D and Schember K Sorting sequential files with limited auxiliary storage Proceedings of the 18th annual Southeast regional conference, (23-31)
- Ellison R A programming sequence for the liberal arts college Proceedings of the eleventh SIGCSE technical symposium on Computer science education, (161-164)
- Ellison R (1980). A programming sequence for the liberal arts college, ACM SIGCSE Bulletin, 12:1, (161-164), Online publication date: 1-Feb-1980.
- Král J (1980). Parkinson programming, ACM SIGPLAN Notices, 15:2, (46-50), Online publication date: 1-Feb-1980.
- Collins W (1979). A data-oriented introduction to program design, ACM SIGCSE Bulletin, 11:4, (49-55), Online publication date: 1-Dec-1979.
- van de Riet R (1979). The little language compiler course project, ACM SIGCSE Bulletin, 11:4, (31-48), Online publication date: 1-Dec-1979.
- Runciman C (1979). Scarcely variabled programming and Pascal, ACM SIGPLAN Notices, 14:11, (97-106), Online publication date: 1-Nov-1979.
- Ancona M, Dodero G and Durante E Cross software development for microprocessors using a translator writing system Proceedings of the 4th international conference on Software engineering, (399-402)
- Graham S, Haley C and Joy W Practical LR error recovery Proceedings of the 1979 SIGPLAN symposium on Compiler construction, (168-175)
- Graham S, Haley C and Joy W (1979). Practical LR error recovery, ACM SIGPLAN Notices, 14:8, (168-175), Online publication date: 1-Aug-1979.
- Gray J Introduction to silicon compilation Proceedings of the 16th Design Automation Conference, (305-306)
- Johnson G A portable discrete event simulation package for microcomputers Proceedings of the 12th annual symposium on Simulation, (27-38)
- Friedman F and Stebulis J (1979). An undergraduate compiler laboratory, ACM SIGCSE Bulletin, 11:1, (28-36), Online publication date: 1-Feb-1979.
- Friedman F and Stebulis J An undergraduate compiler laboratory Proceedings of the tenth SIGCSE technical symposium on Computer science education, (28-36)
- Kovats T (1978). Program readability, closing keywords and prefix-style intermediate keywords, ACM SIGPLAN Notices, 13:11, (30-42), 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.
- Greussay P (1978). Iterative interpretation of tail-recursive LISP procedures, ACM Lisp Bulletin:2, (35-46), 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.
- Bezivin J, Nebut J and Rannou R (1978). Another view of coroutines, ACM SIGPLAN Notices, 13:5, (23-35), Online publication date: 1-May-1978.
- Weiner L The roots of structured programming Papers of the SIGCSE/CSA technical symposium on Computer science education, (243-254)
- Chanon R A course in programming and practice Papers of the SIGCSE/CSA technical symposium on Computer science education, (224-228)
- 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)
- Chvalovsky V Computer science education at universities Papers of the SIGCSE/CSA technical symposium on Computer science education, (41-47)
- Weiner L (1978). The roots of structured programming, ACM SIGCSE Bulletin, 10:1, (243-254), Online publication date: 1-Feb-1978.
- Chanon R (1978). A course in programming and practice, ACM SIGCSE Bulletin, 10:1, (224-228), 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.
- Chvalovsky V (1978). Computer science education at universities, ACM SIGCSE Bulletin, 10:1, (41-47), Online publication date: 1-Feb-1978.
- Iglewski M, Madey J and Matwin S (1978). A contribution to an improvement of PASCAL, ACM SIGPLAN Notices, 13:1, (48-58), Online publication date: 1-Jan-1978.
- McCreight E (1977). Pagination of B*-trees with variable-length records, Communications of the ACM, 20:9, (670-674), Online publication date: 1-Sep-1977.
- Manna Z and Waldinger R The automatic synthesis of recursive programs Proceedings of the 1977 symposium on Artificial intelligence and programming languages, (29-36)
- Manna Z and Waldinger R (2019). The automatic synthesis of recursive programs, ACM SIGART Bulletin:64, (29-36), Online publication date: 1-Aug-1977.
- Manna Z and Waldinger R (1977). The automatic synthesis of recursive programs, ACM SIGPLAN Notices, 12:8, (29-36), 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.
- Edwards R (1977). Is Pascal a logical subset of Algol68 or not? Part One, ACM SIGPLAN Notices, 12:6, (184-191), Online publication date: 1-Jun-1977.
- van der Meulen S (1977). ALGOL 68 might-have-beens, ACM SIGPLAN Notices, 12:6, (1-18), Online publication date: 1-Jun-1977.
- Guibas L, McCreight E, Plass M and Roberts J A new representation for linear lists Proceedings of the ninth annual ACM symposium on Theory of computing, (49-60)
- Edwards R Is Pascal a logical subset of Algol68 or not? Part One Proceedings of the Strathclyde ALGOL 68 conference, (184-191)
- van der Meulen S ALGOL 68 might-have-beens Proceedings of the Strathclyde ALGOL 68 conference, (1-18)
- Chanon R An experiment with an introductory course in computer science Proceedings of the eighth SIGCSE technical symposium on Computer science education, (39-42)
Index Terms
- Algorithms + Data Structures = Programs
Recommendations
MapReduce algorithms for big data analysis
There is a growing trend of applications that should handle big data. However, analyzing big data is a very challenging problem today. For such applications, the MapReduce framework has recently attracted a lot of attention. Google's MapReduce or its ...