Skip to main content
Department of Information Technology

Division of Computer Systems: Publications from 2001

  1. Effective Lossy Queue Languages.. PA Abdulla, L. Boasson, and A. Bouajjani. In ICALP'2001, 28th Int. Colloquium on Automata, Languages and Programmming., 2001. (External link).
  2. The Role of an Operating Systems Course in the IS Major. Robert Adams and Carl Erickson. In Information Systems Education Conference: (ISECON 2000), 2001.
  3. Tools for Real-Time UML: Formal Verification and Code Synthesis. Tobias Amnell, Alexandre David, Elena Fersman, Oliver Möller, Paul Pettersson, and Wang Yi. In Proceedings of the Workshop on Specification, Implementation and Validation of Object-oriented Embedded Systems, 2001.
  4. Mobile Aware Server Architecture: A distributed proxy architecture for content adaptation. Sebastien Ardon, Per Gunningberg, Björn Landfeldt, Yuri Ismailov, Marius Portmann, and Aruna Seneviratne. In INET 2001 Proceedings, 2001. (External link).
  5. SILK: Scout Paths in the Linux Kernel. Andy Bavier, Thiemo Voigt, Mike Wawrzoniak, Larry Peterson, and Per Gunningberg. DoCS, Department of Information Technology, Uppsala University, 2001.
  6. Efficient symbolic state exploration of timed systems: Theory and implementation. Johan Bengtsson. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2001-009, Uppsala University, 2001. (fulltext).
  7. A phenomenographic view on the socio-cultural activity theory in research concerning university students' learning of computer science in an internationally distributed environment. Anders Berglund. In Psychology of Programming Interest Group 13th Annual Workshop, 2001.
  8. Extending UNIX System Logging with SHARP. Matt Bing and Carl Erickson. In 14th Systems Administration Conference (LISA 2000): USENIX, 2001.
  9. A cyber-icebreaker for an effective virtual group?. Tony Clear and Mats Daniels. In ACM SIGCSE Bulletin, volume 33, number 3, 2001. (External link).
  10. Practical verification of real-time systems. Alexandre David. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2001-013, Uppsala University, 2001. (fulltext).
  11. Linux in Education: Teaching System Administration with Linux. Carl Erickson and Robert Adams. In Linux Journal, p 20, 2001.
  12. Interprocess communication utilising special purpose hardware. Johan Furunäs Åkesson. Licentiate thesis, IT licentiate theses / Uppsala University, Department of Information Technology nr 2001-016, Uppsala University, 2001. (fulltext).
  13. Cache-less address translation. Erik Hagersten. 2001.
  14. Communication error reporting mechanism in a multiprocessing computer system. Erik Hagersten. 2001.
  15. Communication error reporting mechanism in a multiprocessing computer system. Erik Hagersten. 2001.
  16. Hybrid memory access protocol in a distributed shared memory computer system. Erik Hagersten. 2001.
  17. Multiprocessing system configured to perform efficient block copy operations. Erik Hagersten. 2001.
  18. Multiprocessing system configured to perform efficient block copy operations. Erik Hagersten. 2001.
  19. Multiprocessing system configured to perform efficient block copy operations. Erik Hagersten. 2001.
  20. Multiprocessor computer system employing a mechanism for routing communication traffic through a cluster node having a slice of memory direct. Erik Hagersten. 2001.
  21. Selective address translation in coherent memory replication. Erik Hagersten. 2001.
  22. Shared memory system for symmetric microprocessor systems. Erik Hagersten. 2001.
  23. Shared memory system for symmetric multiprocessor systems. Erik Hagersten. 2001.
  24. Skewed finite hashing function. Erik Hagersten. 2001.
  25. Skewed finite hashing function. Erik Hagersten. 2001.
  26. Performance of high-accuracy PDE solvers on a self-optimizing NUMA architecture. Sverker Holmgren and Dan Wallin. In Euro-Par 2001: Parallel Processing, volume 2150 of Lecture Notes in Computer Science, pp 602-610, Springer-Verlag, Berlin, 2001. (DOI).
  27. Probabilistic Extensions of Process Algebras. Bengt Jonsson, Kim Larsen, and Wang Yi. In , pp 685-710, ELSEVIER, 2001.
  28. Architectures for application transparent proxies: A study of network enhancing software. Björn Knutsson. Ph.D. thesis, DoCS nr 118, Acta Universitatis Upsaliensis, Uppsala, 2001. (fulltext).
  29. Prefix-recognizable graphs and monadic second order logic. Martin Leucker. In Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, February 2001, pp 263-284, Springer, 2001. (External link).
  30. Tools and Algorithms for the Construction and Analysis of Systems, 7th International Conference, TACAS 2001, Genova, Italy, April 2-6, 2001. Tiziana Margaria and Wang Yi (eds). Volume 2031 of Lecture Notes in Computer Science, Springer, 2001.
  31. A Dynamic Load Balancing Architecture for PDES using PVM on Clusters. Arnold Pears and N. Thong. In Lecture Notes in Computer Science: Recent Advances in Parallel Virtual Machine and Message Passing Interface, volume 2131, pp 166-173, 2001. (External link).
  32. Student Evaluation in an International Collaborative Project Course. Arnold Pears, Mats Daniels, Anders Berglund, and Carl Erickson. In Proceedings WISE workshop, 2001.
  33. Dealing with Memory-Intensive Web Requests. Thiemo Voigt and Per Gunningberg. Technical report / Department of Information Technology, Uppsala University nr 2001-010, 2001. (fulltext).
  34. Kernel-based Control of Persistent Web Server Connections. Thiemo Voigt and Per Gunningberg. In ACM Performance Review, volume 29, number 2, 2001. (DOI).

Updated  2016-12-09 16:25:06 by Peter Waites.