This report contains edited transcripts of the discussions held in Stanford''s course CS 204, Problem Seminar, during autumn quarter 1976. Since the topics span a large range of ideas in computer science, and since most of the important research paradigms and programming paradigms came up during the discussions, the notes may be of use to graduate students of computer science at other universities, as well as to their professors and to professional people in the "real world".
Cited By
- Lagogiannis G and Lorentzos N (2012). Partially persistent B-trees with constant worst-case update time, Computers and Electrical Engineering, 38:2, (231-242), Online publication date: 1-Mar-2012.
- Elmasry A, Farzan A and Iacono J (2012). A priority queue with the time-finger property, Journal of Discrete Algorithms, 16, (206-212), Online publication date: 1-Oct-2012.
- Elmasry A and Katajainen J Fat heaps without regular counters Proceedings of the 6th international conference on Algorithms and computation, (173-185)
- Italiano G and Raman R Topics in data structures Algorithms and theory of computation handbook, (5-5)
- Elmasry A, Jensen C and Katajainen J Strictly-Regular number system and data structures Proceedings of the 12th Scandinavian conference on Algorithm Theory, (26-37)
- Elmasry A, Jensen C and Katajainen J The magic of a number system Proceedings of the 5th international conference on Fun with algorithms, (156-165)
- Rahman M and Munro J (2010). Integer Representation and Counting in the Bit Probe Model, Algorithmica, 56:1, (105-127), Online publication date: 1-Jan-2010.
- Tripunitara M and Carbunar B Efficient access enforcement in distributed role-based access control (RBAC) deployments Proceedings of the 14th ACM symposium on Access control models and technologies, (155-164)
- Elmasry A, Jensen C and Katajainen J (2008). Multipartite priority queues, ACM Transactions on Algorithms, 5:1, (1-19), Online publication date: 1-Nov-2008.
- Rahman M and Munro J Integer representation and counting in the bit probe model Proceedings of the 18th international conference on Algorithms and computation, (5-16)
- Elmasry A, Jensen C and Katajainen J Two-Tier relaxed heaps Proceedings of the 17th international conference on Algorithms and Computation, (308-317)
- Pagh A, Pagh R and Rao S An optimal Bloom filter replacement Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, (823-829)
- Lagogiannis G, Panagis Y, Sioutas S and Tsakalidis A A survey of persistent data structures Proceedings of the 9th WSEAS International Conference on Computers, (1-6)
- Brodal G, Lagogiannis G, Makris C, Tsakalidis A and Tsichlas K (2003). Optimal finger search trees in the pointer machine, Journal of Computer and System Sciences, 67:2, (381-418), Online publication date: 1-Sep-2003.
- Lagogiannis G, Makris C, Panagis Y, Sioutas S and Tsichlas K (2003). New dynamic balanced search trees with worst-case constant update time, Journal of Automata, Languages and Combinatorics, 8:4, (607-632), Online publication date: 1-Jul-2003.
- Kaplan H, Shafrir N and Tarjan R Meldable heaps and boolean union-find Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, (573-582)
- Brodal G, Lagogiannis G, Makris C, Tsakalidis A and Tsichlas K Optimal finger search trees in the pointer machine Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, (583-591)
- Kaplan H and Tarjan R Purely functional representations of catenable sorted lists Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, (202-211)
Recommendations
The National Science Foundation (seminar session): funding opportunities for CS faculty through the CCLI program
A new program in undergraduate education at the National Science Foundation is the Course, Curriculum and Laboratory Improvement (CCLI) program. CCLI has two tracks that are of particular interest to CS faculty members. They are the Educational ...