Aarhus Universitets segl

Publikationer

Følg med i de senest publicerede videnskabelige artikler fra Institut for Biologi. Oversigten viser Instituttets publikationer med de nyeste øverst:

Sortér efter: Dato | Forfatter | Titel

Arge, L. A. (1995). The I/O-complexity of Ordered Binary-Decision Diagram manipulation: Extended Abstract. I J. Staples, P. Eades, N. Katoh & A. Moffat (red.), Algorithms and Computations: 6th International Symposium, ISAAC '95 Cairns, Australia, December 4-6, 1995 Proceedings (s. 82-91). Springer. https://doi.org/10.1007/BFb0015411
Arge, L. A., Knudsen, M. & Larsen, K. (1993). A general lower bound on the I/O-complexity of comparison-based algorithms. I F. Dehne, J.-R. Sack, N. Santoro & S. Whitesides (red.), Algorithms and Data Structures: Third Workshop, WADS '93 Montréal, Canada, August 11-13, 1993 Proceedings (s. 83-94). Springer. https://doi.org/10.1007/3-540-57155-8_238
Verhoeven, J. T. A. & Sorrell, B. K. (2010). Plant adaptations and microbial processes in wetlands. Annals of Botany, 105, 127.
Mailund, T. & Westergaard, M. (2004). Obtaining Memory-Efficient Reachability Graph. I K. Jensen & A. Podelski (red.), Tools and Algorithms for the Construction and Analysis of Systems: 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004. Proceedings (s. 177-191). Springer.
Jensen, K. (red.) (1992). Application and Theory of Petri Nets. Springer. Lecture Notes in Computer Science Bind 616 https://doi.org/10.1007/3-540-55676-1
Scherer, M., Lücke, B., Gebreyesus, G., Topic, O., Deuretzbacher, F., Ertmer, W., Santos, L., Arlt, J. & Klempt, C. (2010). Spontaneous Breaking of Spatial and Spin Symmetry in Spinor Condensates. Physical Review Letters, 105(13), 135302. https://doi.org/10.1103/PhysRevLett.105.135302
Nielsen, V. H., Anistoroaei, R. M., Guldbrandtsen, B., Christensen, K. & Fredholm, M. (2010). Jagten på pelsgener. Afhandling præsenteret på Aktuel Pelsdyrforskning, Tjele, Danmark.
Langdal, J., Kjærgaard, M. B., Toftkjær, T. & Schougaard, K. R. (2010). Exposing Position Uncertainty in Middleware. I S. Terzis & L. Veiga (red.), Proceedings of the Second International Workshop on Middleware for Pervasive Mobile and Embedded Computing (M-MPAC 2010) (s. Article no. 1). Association for Computing Machinery. https://doi.org/10.1145/1890791.1890792
Schougaard, K. R. & Langdal, J. (2010). Model-based Translucency in Middleware: Supporting Seamful Development. I S. Terzis & L. Veiga (red.), Proceedings of the 2nd International Workshop on Middleware for Pervasive Mobile and Embedded Computing : M-MPAC'10 (s. Article No. 6 ). Association for Computing Machinery. https://doi.org/10.1145/1890791.1890797
Jensen, K. (1987). Coloured Petri Nets: A way to describe and analyse real-world systems - without drowning in unnecessary details. I Proceedings of the fifth International Conference on Systems Engineering (s. 395-401). IEEE.
Arge, L. A. (2003). Implementing External Memory Algorithms and Data Structures. I Proceedings of 5th Workshop on Algorithm Engineering and Experiments Society for Industrial and Applied Mathematics.
Arge, L. A., Barve, R., Hutchinson, D., Procopiuc, O., Toma, L., Vengroff, D. E. & Wickeremsinghe, R. (2002). TPIE: User Manual and Reference. (082902 udg.) Duke University Press. http://www.cs.duke.edu/TPIE/tpie.pdf
Arge, L. A. (2001). External Memory Data Structures. I F. M. A. D. Heide (red.), Algorithms - ESA 2001: 9th Annual European Symposium Århus, Denmark, August 28-31, 2001 Proceedings (s. 1-29). Springer. https://doi.org/10.1007/3-540-44676-1_1
Arge, L. A., Ferragina, P., Grossi, R. & Vitter, J. S. (1997). Sequeance sorting in secondary storage. I Compression and Complexity of Sequences 1997. Proceedings (s. 329-346). IEEE. https://doi.org/10.1109/SEQUEN.1997.666927
Agarwal, P. K., Arge, L. A. & Yi, K. (2006). I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis. I Proceedings of the twenty-second annual symposium on Computational geometry (s. 167-176). Association for Computing Machinery. https://doi.org/10.1145/1137856.1137884
Arge, L. A., Danner, A. & Teh, S.-M. (2003). I/O-efficient Point Location uisng Persistent B-Trees. I Proceedings of 5th Workshop on Algorithm Engineering and Experiments Society for Industrial and Applied Mathematics. http://www.siam.org/meetings/alenex03/Abstracts/large.pdf
Arge, L. A., Bender, M. A., Demaine, E. D., Holland-Minkley, B. & Munro, J. I. (2002). Cache-oblivious priority queue and graph algorithm applications. I Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (s. 268-276). Association for Computing Machinery. https://doi.org/10.1145/509907.509950
Toma, L., Wickremsinghe, R., Arge, L. A., Chase, J. S., Vitter, J. S., Halpin, P. N. & Urban, D. (2001). Flow computation on massive grids. I Proceedings of the 9th ACM international symposium on Advances in geographic information systems (s. 82-87). Association for Computing Machinery. https://doi.org/10.1145/512161.512180
Arge, L. A., Meyer, U., Toma, L. & Zeh, N. (2001). On External-Memory Planar Depth First Search. I F. Dehne, J.-R. Sack & R. Tamassia (red.), Algorithms and Data Structures: 7th International Workshop, WADS 2001 Providence, RI, USA, August 8-10, 2001 Proceedings (s. 471-482). Springer. https://doi.org/10.1007/3-540-44634-6_43
Arge, L. A., Chase, J. S., Vitter, J. S. & Wickremsinghe, R. (2000). Efficient Sorting Using Registers and Caches. I S. Näher & D. Wagner (red.), Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (s. 51-62) https://doi.org/10.1007/3-540-44691-5_5
Agarwal, P. K., Arge, L. A. & Erickson, J. (2000). Indexing Moving Points. I Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (s. 175-186). Association for Computing Machinery. https://doi.org/10.1145/335168.335220
Arge, L. A., Brodal, G. S. & Toma, L. (2000). On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. I Algorithm Theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5-7, 2000 Proceedings (s. 709-715). Springer. https://doi.org/10.1007/3-540-44985-X_37
Arge, L. A. & Vahrenhold, J. (2000). I/O-efficient dynamic planar point location. I Proceedings of the sixteenth annual symposium on Computational geometry (s. 191-200). Association for Computing Machinery. https://doi.org/10.1145/336154.336205
Agarwal, P. K., Arge, L. A., Erickson, J., Franciosa, P. G. & Vitter, J. S. (1998). Efficient Searching with Linear Constraints. I Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (s. 169-178). Association for Computing Machinery. https://doi.org/10.1145/275487.275506
Arge, L. A. & Vitter, J. S. (1996). Optimal Dynamic Interval Management in External Memory. I 37th Annual Symposium on Foundations of Computer Science, 1996. Proceedings., (s. 560-569). IEEE Computer Society Press. https://doi.org/10.1109/SFCS.1996.548515
Arge, L. A., Vengroff, D. E. & Vitter, J. S. (1995). External-Memory Algorithms for Processing Line Segments in Geographic Information Systems. I P. Spirakis (red.), Algorithms - ESA '95: Third Annual European Symposium Corfu, Greece, September 25-27, 1995 Proceedings (s. 295-310). Springer. https://doi.org/10.1007/3-540-60313-1_151
Arge, L. A. (1995). The buffer tree: A new technique for optimal I/O-algorithms. I S. G. Akl, F. Dehne, J.-R. Sack & N. Santoro (red.), Algorithms and Data Structures: 4th International Workshop, WADS '95 Kingston, Canada, August 16-18, 1995 Proceedings (s. 334-345). Springer. https://doi.org/10.1007/3-540-60220-8_74
Aceto, L., Damgård, I. B., Goldberg, L. A., Halldórsson, M. M., Ingólfsdóttir, A. & Walukiewicz, I. (2008). Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II. Springer. Lecture Notes in Computer Science Bind 5126 https://doi.org/10.1007/978-3-540-70583-3
Damgård, I. B. (1987). Concatenated Group Codes and Their Exponents. I E E E Transactions on Information Theory, Vol. 33, Issue 6.
Damgård, I. B. (1987). Collision Free Hash Functions and Public Key Signature Schemes. I D. Chaum & W. L. Price (red.), Advances in Cryptology - EUROCRYPT' 87: Workshop on the Theory and Application of Cryptographic Techniques Amsterdam, The Netherlands, April 13-15, 1987 Proceedings (s. 203-216). Springer. https://doi.org/10.1007/3-540-39118-5_19
Chaum, D., Crépeau, C. & Damgård, I. B. (1987). Multiparty Unconditionally Secure Protocols (Abstract). I C. Pomerance (red.), Advances in Cryptology - CRYPTO '87: Proceedings (s. 462). Springer. https://doi.org/10.1007/3-540-48184-2_43
Chaum, D., Damgård, I. B. & van der Graaf, J. (1987). Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result. I C. Pomerance (red.), Advances in Cryptology - CRYPTO '87: Proceedings (s. 87-119). Springer. https://doi.org/10.1007/3-540-48184-2_7
Brickell, E. F., Chaum, D., Damgård, I. B. & van der Graaf, J. (1987). Gradual and Verifiable Release of a Secret (Extended Abstract). I C. Pomerance (red.), Advances in Cryptology - CRYPTO '87: Proceedings (s. 156-166). Springer. https://doi.org/10.1007/3-540-48184-2_11
Chaum, D., Crépeau, C. & Damgård, I. B. (1988). Multiparty unconditionally secure protocols. I Proceedings of the twentieth annual ACM symposium on Theory of computing (s. 11-19). Association for Computing Machinery. https://doi.org/10.1145/62212.62214
Jørgensen, B. B., Dunker, R., Grünke, S. & Røy, H. (2010). Filamentous sulfur bacteria, Beggiatoa spp., in arctic marine sediments (Svalbard, 79°N). FEMS Microbiology Ecology, 73(3), 500-513.
Brandt, J., Damgård, I. B., Landrock, P. & Pedersen, T. P. (1988). Zero-Knowledge Authentication Scheme with Secret Key Exchange (extended abstract). I S. Goldwasser (red.), Advances in Cryptology - CRYPTO' 88: Proceedings (s. 583-588). Springer. https://doi.org/10.1007/0-387-34799-2_43
Damgård, I. B. (1988). Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals. I S. Goldwasser (red.), Advances in Cryptology - CRYPTO' 88: Proceedings (s. 328-335). Springer. https://doi.org/10.1007/0-387-34799-2_26
Damgård, I. B. (1988). On The Randomness of Legendre and Jacobi Sequences. I S. Goldwasser (red.), Advances in Cryptology - CRYPTO' 88: Proceedings (s. 163-172). Springer. https://doi.org/10.1007/0-387-34799-2_13

Sortér efter: Dato | Forfatter | Titel