Publications

Search for publications at Department of Computer Science

Below you find a complete list of publications published and edited by scientists at the Department of Computer Science

Brodal, G. S. & Jakob, R. (2000). Dynamic Planar Convex Hull with Optimal Query Time and O(log n · log log n ) Update Time. In Algorithm Theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5–7, 2000 Proceedings (pp. 181-186). Springer. https://doi.org/10.1007/3-540-44985-X_7

Damgård, I. B. (2000). Efficient Concurrent Zero-Knowledge in the Auxiliary String Model. In B. Preneel (Ed.), Advances in Cryptology - EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14-18, 2000 Proceedings (pp. 418-430). Springer. https://doi.org/10.1007/3-540-45539-6_30

Agarwal, P. K., Arge, L. A., Erickson, J., Franciosa, P. G. & Vitter, J. S. (2000). Efficient Searching with Linear Constraints. Journal of Computer and System Sciences, 61, Issue 2, 194-216. https://doi.org/10.1006/jcss.2000.1709

Arge, L. A., Chase, J. S., Vitter, J. S. & Wickremsinghe, R. (2000). Efficient Sorting Using Registers and Caches. In S. Näher & D. Wagner (Eds.), Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (pp. 51-62) https://doi.org/10.1007/3-540-44691-5_5

Cramer, R., Damgård, I. B. & MacKenzie, P. (2000). Efficient Zero-Knowledge Proofs of Knowledge without Intractability Assumptions. In H. Imai & Y. Zheng (Eds.), Public Key Cryptography: Third International Workshop on Practice and Theory in Public Key Cryptosystems, PKC 2000, Melbourne, Victoria, Australia, January 18-20, 2000. Proceedings (pp. 354-373). Springer. https://doi.org/10.1007/978-3-540-46588-1_24

Bouvin, N. O. & Anderson, K. M. (2000). Enabling project awareness and intersubjectivity via hypermedia-enabled event trails. University of Colorado.

Bouvin, N. O. (2000). Experiences with OHP and Issues for the Future. In Open Hypermedia Systems and Structural Computing: 6th International Workshop, OHS-6 2nd International Workshop, SC-2 San Antonio, Texas, USA, May 30 – June 3, 2000 Proceedings (pp. 191-206). Springer. https://doi.org/10.1007/3-540-39941-0_3

Brodal, G. S. & Pedersen, C. N. S. (2000). Finding Maximal Quasiperiodicities in Strings. In R. Giancarlo & D. Sankoff (Eds.), Combinatorial Pattern Matching: 11th Annual Symposium, CPM 2000 Montreal, Canada, June 21–23, 2000 Proceedings (pp. 397-411). Springer. https://doi.org/10.1007/3-540-45123-4_33

Danvy, O. (2000). Formalizing Implementation Strategies for First-Class Continuations. In G. Smolka (Ed.), Programming Languages and Systems: 9th European Symposium on Programming, ESOP 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, March 25 – April 2, 2000 Proceedings (pp. 88-103). Springer. https://doi.org/10.1007/3-540-46425-5_6

Bødker, S. & Buur, J. (2000). From usability lab to design collaboratorium: reframing usability practice. In Proceedings of the 3rd conference on Designing interactive systems: processes, practices, methods, and techniques (pp. 297-307). Association for Computing Machinery. https://doi.org/10.1145/347642.347768

Danvy, O. (2000). Functional unparsing. Journal of Functional Programming, 621-625.

Cramer, R., Damgård, I. B. & Maurer, U. (2000). General Secure Multi-party Computation from any Linear Secret-Sharing Scheme. In B. Preneel (Ed.), Advances in Cryptology - EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14-18, 2000 Proceedings (pp. 316-334). Springer. https://doi.org/10.1007/3-540-45539-6_22

Jurdzinski, M. & Nielsen, M. (2000). Hereditary History Preserving Bisimilarity Is Undecidable. In H. Reichel & S. Tison (Eds.), STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science Lille, France, February 17-19, 2000 Proceedings (pp. 358-369). Springer. https://doi.org/10.1007/3-540-46541-3_30

Christensen, H. B. & Caspersen, M. E. (2000). Here, There and Everywhere - On the Recurring Use of Turtle Graphics in CS1. In Proceedings of the Australasian conference on Computing education (pp. 34-40). Association for Computing Machinery. https://doi.org/10.1145/359369.359375

Mogensen, P. H. & Grønbæk, K. (2000). Hypermedia in the Virtual Project Room - Toward Open 3D Spatial Hypermedia. In Proceedings of the Eleventh Conference on Hypertext and Hypermedia (pp. 113-122). Association for Computing Machinery. https://doi.org/10.1145/336296.336340

Brodal, G. S. & Srinivasan, V. (2000). Improved Bounds for Dictionary Look-up with One Error. Information Processing Letters, 75(1-2), 57-59. https://doi.org/10.1016/S0020-0190(00)00079-X

Damgård, I. B. & Nielsen, J. B. (2000). Improved Non-committing Encryption Schemes Based on a General Complexity Assumption. In M. Bellare (Ed.), Advances in Cryptology - CRYPTO 2000: 20th Annual International Cryptology Conference Santa Barbara, California, USA, August 20-24, 2000 Proceedings (pp. 432-450). Springer. https://doi.org/10.1007/3-540-44598-6_27

Agarwal, P. K., Arge, L. A. & Erickson, J. (2000). Indexing Moving Points. In Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (pp. 175-186). Association for Computing Machinery. https://doi.org/10.1145/335168.335220

Bødker, S. & Bertelsen, O. W. (2000). Introduction to special issue on activity theory and information systems design. Scandinavian Journal of Information Systems, 12, 3-14. http://iris.cs.aau.dk/tl_files/volumes/volume12/no1/01-intro_p3-14.pdf

Arge, L. A. & Vahrenhold, J. (2000). I/O-efficient dynamic planar point location. In Proceedings of the sixteenth annual symposium on Computational geometry (pp. 191-200). Association for Computing Machinery. https://doi.org/10.1145/336154.336205

Pagter, J. I. & Arge, L. (2000). I/O-Space Trade-Offs: Extended Abstract. In Algorithm Theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5-7, 2000 Proceedings (pp. 509-514). Springer. https://doi.org/10.1007/3-540-44985-X_38

Danvy, O. & Schultz, U. P. (2000). Lambda-dropping: transforming recursive equations into programs with block structure . Theoretical Computer Science, 248(1-2), 243-287. https://doi.org/10.1016/S0304-3975(00)00054-2

Nielsen, M. & Rovan, B. (Eds.) (2000). Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 Proceedings. Springer. Lecture Notes in Computer Science Vol. 1893 https://doi.org/10.1007/3-540-44612-5

Kjær, A., Petersen, M. G. & Madsen, K. H. (2000). Methodological Challenges in the Study of Technology at Home. In A. Sloane & F. van Rijn (Eds.), Home Informatics and Telematics: Information Society and Technology (pp. 45-60). Kluwer Academic Publishers.

Hansen, K. M. (2000). Modelling in Experimental System Development.

Christensen, H. B. (2000). Modularisation of Software Configuration Management In W. Weck & J. Gutknecht (Eds.), Modular Programming Languages: Joint Modular Languages Conference, JMLC 2000, Zurich, Switzerland, September 6-8, 2000. Proceedings (pp. 134-146). Springer. https://doi.org/10.1007/10722581_12

Buhrman, H., Miltersen, P. B. & Laplante, S. (2000). New bounds for the language compression problem. In 15th Annual IEEE Conference on Computational Complexity, 2000. Proceedings. (pp. 126-130). IEEE Computer Society Press. https://doi.org/10.1109/CCC.2000.856742

Alstrup, S., Brodal, G. S. & Rauhe, T. (2000). New data structures for orthogonal range searching. In 41st Annual Symposium on Foundations of Computer Science, 2000. Proceedings. (pp. 198-207). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.2000.892088

Arge, L. A., Brodal, G. S. & Toma, L. (2000). On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. In Algorithm Theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5-7, 2000 Proceedings (pp. 709-715). Springer. https://doi.org/10.1007/3-540-44985-X_37

Cramer, R., Damgård, I. B. & Dziembowski, S. (2000). On the complexity of verifiable secret sharing and multiparty computation. In Proceedings of the thirty-second annual ACM symposium on Theory of computing (pp. 325-334). Association for Computing Machinery. https://doi.org/10.1145/335305.335343

Frandsen, G. S. (2000). On the Density of Normal Bases in Finite Fields. Finite Fields and Their Applications, 6(1), 23-38. https://doi.org/10.1006/ffta.1999.0263

Miltersen, P. B. (2000). On the Shannon function for partially defined Boolean functions. In Proceedings of the Workshop on Boolean Functions and Applications

Grønbæk, K., Bouvin, N. O. & Sloth, L. (2000). Open Hypermedia as User Controlled Meta Data for the Web. Computer Networks, 33(1-6), 553-566. https://doi.org/10.1016/S1389-1286(00)00070-0

Grønbæk, K., Sloth, L. & Bouvin, N. O. (2000). Open Hypermedia as User Controlled Meta Data for the Web. In Proceedings of the 9th World Wide Web Conference

Danvy, O. & Hatcliff, J. (2000). Partial Evaluation. In A. Ralston, E. Reilly & D. Hemmendinger (Eds.), Encyclopedia of Computer Science (pp. 1370-1371). Macmillan Reference.

Alstrup, S., Brodal, G. S. & Rauhe, T. (2000). Pattern matching in dynamic texts. In D. Shmoys (Ed.), Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (pp. 819-828). Society for Industrial and Applied Mathematics.

Nielsen, T. T. & Wigard, J. (2000). Performance Enhancements in a Frequency Hopping GSM Network. Kluwer Academic Publishers. http://www.springerlink.com/content/978-0-7923-7819-8

Brabrand, C., Møller, A., Ricky, M. & Schwartzbach, M. I. (2000). PowerForms: Declarative Client-side Form Field Validation. World Wide Web (New York), 3(4), 205-214. https://doi.org/10.1023/A:1018772405468

Jensen, K. (Ed.) (2000). Practical Use of High-level Petri Net. Workshop Proceedings. Department of Computer Science, Aarhus University.

Bussard, L., Carver, L., Ernst, E., Jung, M., Robillard, M. & Speck, A. (2000). Safe Aspect Composition. In G. Goos, J. Hartmanis, J. van Leeuwen, J. Malenfant, S. Moisan & A. Moreira (Eds.), Object-Oriented Technology: ECOOP 2000 Workshop Reader ECOOP 2000 Workshops, Panels, and Posters Sophia Antipolis and Cannes, France, June 12–16, 2000 Proceedings (pp. 205-210). Springer. https://doi.org/10.1007/3-540-44555-2_16

Bødker, S. (2000). Scenarios - setting the stage for reflection and action in user-centered design. Interacting with Computers, 13(1), 61-77.

Ernst, E. (2000). Separation of Concerns and Then What? In L. Bergmans (Ed.), Position papers from the workshop on Aspects and Dimensions of Concern. University of Twente. http://trese.cs.utwente.nl/Docs/workshops/adc2000/papers/Ernst.pdf

Boyar, J., Damgård, I. B. & Peralta, R. (2000). Short Non-Interactive Cryptographic Proofs. Journal of Cryptology, 13(4), 449-472. https://doi.org/10.1007/s001450010011

Cornils, A. & Hedin, G. (2000). Statically checked documentation with design patterns. In 33rd International Conference on Technology of Object-Oriented Languages, 2000. TOOLS 33. Proceedings. (pp. 419-430). IEEE. https://doi.org/10.1109/TOOLS.2000.848780

Hein, J., Wiuf, C., Møller, M., Knudsen, B. & Wibling, G. (2000). Statistical alignment: computational properties, homology testing and goodness-of-fit. J. Mol. Biol., 302(1), 265-279. https://doi.org/10.1006/jmbi.2000.4061

Anderson, K. M. & Bouvin, N. O. (2000). Supporting project awareness on the WWW with the iScent framework. SIGGROUP Bulletin, 21(3), 16-20. https://doi.org/10.1145/605647.605650

Hansen, K. M., Damm, C. H., Thomsen, M. & Tyrsted, M. (2000). Supporting several levels of restriction in the UML. In A. Evans, S. Kent & B. Selic (Eds.), «UML» 2000 - The Unified Modeling Language: Advancing the Standard. Third International Conference York, UK, October 2-6, 2000 Proceedings (pp. 396-409). Springer. https://doi.org/10.1007/3-540-40011-7_29

Damian, D. & Danvy, O. (2000). Syntactic accidents in program analysis: on the impact of the CPS transformation. In Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (pp. 209-220). Association for Computing Machinery.

Daniel, D. & Danvy, O. (2000). Syntactic Accidents in Program Analysis: On the Impact of the CPS Transformation. BRICS Report Series, (RS-00-15).

Ernst, E. (2000). Syntax Based Modularization: Invasive or Not?. Paper presented at Conference on Object-Oriented Programming, Systems, Languages, and Applications. OOPSLA 2000, Minneapolis. MN, United States.

Displaying results 5201 to 5250 out of 5933

105