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

Kölker, J. (2012). The Magnets Puzzle is NP-Complete. Journal of Information Processing, 20(3), 707-708 . https://doi.org/10.2197/ipsjjip.20.707

Christensen, H. B. (2012). The Net4Care Platform. http://www.net4care.org

Balasch, J., Faust, S., Gierlichs, B. & Verbauwhede, I. (2012). Theory and Practice of a Leakage Resilient Masking Scheme. Lecture Notes in Computer Science, 7658, 758-775. https://doi.org/10.1007/978-3-642-34961-4_45

Keller, M. (2012). Theory and practice of cryptographic protocols -or- cryptography: will it blend? Department of Computer Science, Aarhus University.

Afshani, P., Afrawal, M., Benjamin, D., Larsen, K. G., Mehlhorn, K. & Winzen, C. (2012). The Query Complexity of Finding a Hidden Permutation. Electronic Colloquium on Computational Complexity, (TR12-087). http://eccc.hpi-web.de/report/2012/087/

Sun, X., Wang, C. & Yu, W. (2012). The Relationship between Inner Product and Counting Cycles. Lecture Notes in Computer Science, 7256, 643-654. https://doi.org/10.1007/978-3-642-29344-3_54

Jensen, K., Kristensen, L. M. & Mailund, T. (2012). The sweep-line state space exploration method. Theoretical Computer Science, 429, 169–179. https://doi.org/10.1016/j.tcs.2011.12.036

David P., W. & Zhang, Q. (2012). Tight Bounds for Distributed Functional Monitoring. In Proceedings of the 2012 ACM Symposium on Theory of Computing, STOC’12 (pp. 941-960). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214063

Gál , A., Hansen, K. A., Koucký, M., Pudlák, P. & Viola, E. (2012). Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. In H. Karloff & T. Pitassi (Eds.), STOC '12 Proceedings of the 44th symposium on Theory of Computing (pp. 479-494). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214023

Bulánek, J., Koucky, M. & Saks, M. (2012). Tight lower bounds for the online labeling problem. In Proceedings of the 2012 ACM Symposium on Theory of Computing, STOC’12 (pp. 1185-1198). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214083

Schmidt, E. M., Skyum, S. & Nielsen, M. (2012). To Dexter - A Tribute from Aarhus. In R. L. Constable & A. Silva (Eds.), Logic and Program Semantics : Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday (pp. 341). Springer. https://doi.org/10.1007/978-3-642-29485-3_30

Sandel, B. S. & Svenning, J.-C. (2012). Topographic controls on the distribution of tree cover from local to global scales. Abstract from The Ecological Society of America, 89th Annual Meeting, Portland, United States.

Andersen, M. S. & Kjærgaard, M. B. (2012). Towards a New Classification of Location Privacy Methods in Pervasive Computing. In A. Puiatti & T. Gu (Eds.), Mobile and Ubiquitous Systems: Computing, Networking, and Services : 8th International ICST Conference, MobiQuitous 2011, Copenhagen, Denmark, December 6-9, 2011, Revised Selected Papers (Vol. 104, pp. 150-161). Springer. https://doi.org/10.1007/978-3-642-30973-1_13

Jensen, K., Donatelli, S. & Kleijn , J. (Eds.) (2012). Transactions on Petri Nets and Other Models of Concurrency V: ToPNoC. Springer. Lecture Notes in Computer Science Vol. 6900 https://doi.org/10.1007/978-3-642-29072-5

Jensen, K., Aalst, W. M. V. D., Marsan, M. A., Franceschinis, G., Kleijn , J. & Kristensen, L. M. (Eds.) (2012). Transactions on Petri Nets and Other Models of Concurrency VI: ToPNoC. Springer. Lecture Notes in Computer Science Vol. 7400 https://doi.org/10.1007/978-3-642-35179-2

Nielsen, M. & Krukow, K. (2012). Transfer of Trust in Event-based Reputation Systems. Theoretical Computer Science, 429, 236-246. https://doi.org/10.1016/j.tcs.2011.12.044,

Davoodi, P., Smid, M. & Walderveen, F. V. (2012). Two-dimensional range diameter queries. Lecture Notes in Computer Science, 7256, 219–230. https://doi.org/10.1007/978-3-642-29344-3_19

Brodal, G. S., Davoodi, P., Lewenstein, M., Raman, R. & Rao, S. S. (2012). Two Dimensional Range Minimum Queries and Fibonacci Lattices. Lecture Notes in Computer Science, 7501, 217-228 . https://doi.org/10.1007/978-3-642-33090-2_20

Hilker, R., Sickinger, C., Pedersen, C. N. S. & Stoye, J. (2012). UniMoG - A unifying framework for genomic distance calculation and sorting based DCJ. Bioinformatics, 28(19), 2509-2511. https://doi.org/10.1093/bioinformatics/bts440

Kjærgaard, M. B. & Blunck, H. (2012). Unsupervised Power Profiling for Mobile Devices. In A. Puiatti & T. Gu (Eds.), Mobile and Ubiquitous Systems: Computing, Networking, and Services: 8th International ICST Conference, MobiQuitous 2011, Copenhagen, Denmark, December 6-9, 2011, Revised Selected Papers (pp. 138-149). Springer. https://doi.org/10.1007/978-3-642-30973-1_12

Lu, H. & Jensen, C. S. (2012). Upgrading Uncompetitive Products Economically. In IEEE 28th International Conference on Data Engineering (ICDE) (pp. 977 - 988 ). IEEE Press. https://doi.org/10.1109/ICDE.2012.92

Mailund, T., Halager, A. E. & Westergaard, M. (2012). Using colored Petri nets to construct coalescent hidden markov models: Automatic translation from demographic specifications to efficient inference methods. Lecture Notes in Computer Science, 7347, 32-50. https://doi.org/10.1007/978-3-642-31131-4_3

Andersen, M. S., Kjærgaard, M. B. & Grønbæk, K. (2012). Using Extracted Behavioral Features to Improve Privacy for Shared Route Tracks. In A. U. Schmidt, G. Russello, I. Krontiris & S. Lian (Eds.), Security and Privacy in Mobile Information and Communication Systems : 4th International Conference, MobiSec 2012, Frankfurt am Main, Germany, June 25-26, 2012, Revised Selected Papers (pp. 107-118). Springer. https://doi.org/10.1007/978-3-642-33392-7_12

Thomsen, J. G., Ernst, E., Brabrand, C. & Schwartzbach, M. I. (2012). WebSelF: A Web Scraping Framework . Lecture Notes in Computer Science, 7387, 347-361. https://doi.org/10.1007/978-3-642-31753-8_28

Sheng, Q. Z., Wang, G., Jensen, C. S. & Xu, G. (Eds.) (2012). Web Technologies and Applications: 14th Asia-Pacific Web Conference, APWeb 2012, Kunming, China, April 11-13, 2012. Proceedings. Springer. Lecture Notes in Computer Science Vol. 7235 https://doi.org/10.1007/978-3-642-29253-8

Ackerman, M., Ben-David, S., Branzei, S. & Loker, D. (2012). Weighted Clustering. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (pp. 858-863). AAAI Press.

Mathiasen, N. R. (2012). While Working Around Security. Department of Computer Science, Aarhus University.

Hansen, T. D. (2012). Worst-case Analysis of Strategy Iteration and the Simplex Method. Aarhus Universitet, Datalogisk Institut.

Damgård, I. B. & López-Alt, A. (2012). Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions. Lecture Notes in Computer Science, 7485, 38-56 . https://doi.org/10.1007/978-3-642-32928-9_3

Danvy, O. & Midtgaard, J. (2011). Abstracting abstract machines: technical perspective. Association for Computing Machinery. Communications, 54(9), 100-100. https://doi.org/10.1145/1995376.1995399

Nielsen, J. (2011). A Coarse-to-Fine Approach to Computing the k-best Viterbi Paths. Lecture Notes in Computer Science, 6661, 376-387. https://doi.org/10.1007/978-3-642-21458-5_32

Bohøj, M., Bouvin, N. O. & Gammelmark, H. (2011). Adapforms: A framework for creating and validating adaptive forms. Lecture Notes in Computer Science, 6757, 105-120. https://doi.org/10.1007/978-3-642-22233-7_8

Rohde, J. & Toftegaard, T. S. (2011). Adaption of Cognitive Radio technology to low-cost and low-power wireless Personal Area Network devices. Wireless Personal Communications, 58(1), 111-123. https://doi.org/10.1007/s11277-011-0291-x

Backes, M., Goldberg, I., Kate, A. & Toft, T. (2011). Adding Query Privacy to Robust DHTs. http://arxiv.org/abs/1107.1072

Hladik, M., Daney, D. & Tsigaridas, E. (2011). A filtering method for the interval eigenvalue problem. Applied Mathematics and Computation, 217(12), 5236-5242. https://doi.org/10.1016/j.amc.2010.09.066

Artzi, S., Dolby, J., Jensen, S. H., Møller, A. & Tip, F. (2011). A Framework for Automated Testing of JavaScript Web Applications. In Proceeding of the 33rd International Conference on Software Engineering (pp. 571-580). Association for Computing Machinery. https://doi.org/10.1145/1985793.1985871

Müller, E., Assent, I., Günnemann, S., Gerwert, P., Hannen, M., Jansen, T. & Seidl, T. (2011). A Framework for Evaluation and Exploration of Clustering Algorithms in Subspaces of High Dimensional Databases. In T. Härder, W. Lehner, B. Mitschang, H. Schöning & H. Schwarz (Eds.), Proceedings of the 14th GI Conference on Database Systems for Business, Technology, and the Web (BTW 2011) (pp. 347-366). Gesellschaft für Informatik e.V..

Nielsen, J. & Sand, A. (2011). Algorithms for a parallel implementation of Hidden Markov Models with a small state space. In 2011 IEEE IPDPS Workshops & PhD Forum (pp. 447-454). IEEE Computer Society Press. https://doi.org/10.1109/IPDPS.2011.181

Lin, D., Jensen, C. S., Zhang, R., Xiao, L. & Lu, J. (2011). A Moving-Object Index for Efficient Query Processing with PeerWise Location Privacy. Proceedings of the VLDB Endowment, 5(1), 37-48. http://www.vldb.org/pvldb/vol5/p037_danlin_vldb2012.pdf

Nielsen, J. B., Nordholt, P. S., Orlandi, C. & Burra, S. S. (2011). A New Approach to Practical Active-Secure Two-Party Computation. http://eprint.iacr.org/2011/091

Nguyen, H. V., Gopalkrishnan, V. & Assent, I. (2011). An Unbiased Distance-based Outlier Detection Approach for High-dimensional Data. Lecture Notes in Computer Science, 6587, 138-152. https://doi.org/10.1007/978-3-642-20149-3_12

Afshani, P., Agarwal, P. K., Arge, L. A., Larsen, K. G. & Phillips, J. M. (2011). (Approximate) Uncertain Skylines. In Proceedings of the 14th International Conference on Database Theory (pp. 186-196). Association for Computing Machinery. https://doi.org/10.1145/1938551.1938576

Ting, H.-F., Lee, L. K., Chan, H.-L. & Lam, T.-W. (2011). Approximating Frequent Items in Asynchronous Data Stream over a Sliding Window. Algorithms, 4(3), 200-222. https://doi.org/10.3390/a4030200

Cherabini, L. & Danvy, O. (2011). A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration. Journal of Formalized Reasoning, 4(1), 85-109. http://jfr.cib.unibo.it/article/view/2225

Christensen, H. B. & Hansen, K. M. (2011). Architecture for Telemedicine / Net4Care Technical Report #2.

Kolstad, H. A., Stokholm, Z. A., Jensen, C. S., Frederiksen, T. W. & Bonde, J. P. (2011). Are occupational noise-exposure levels declining? In 10th International Congress on Noise as a Public Health Problem 2011, ICBEN 2011 - Proceedings of the Institute of Acoustics (PART 3 ed., Vol. 33 1, pp. 148-151)

Nielsen, J., Kristensen, A. K., Mailund, T. & Pedersen, C. N. S. (2011). A sub-cubic time algorithm for computing the quartet distance between two general trees. Algorithms for Molecular Biology, 6(15). https://doi.org/10.1186/1748-7188-6-15

Friedmann, O., Hansen, T. D. & Zwick, U. (2011). A subexponential lower bound for the Random Facet algorithm for Parity Games. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms. SODA 2011 (pp. 202-216). Society for Industrial and Applied Mathematics. http://www.siam.org/proceedings/soda/2011/SODA11_019_friedmanno.pdf

Christensen, L. R. & Grönvall, E. (2011). Augmented Binder-Supporting Cooperative Home Care Work. In Infrastructures for Healthcare: Proceedings of the 3rd International Workshop (pp. 67-70). global-interaction.org. http://global-interaction.org/en/Publications/Infrastructures%20on%20Healthcare

Danvy, O., Johannsen, J. & Zerny, I. (2011). A Walk in the Semantic Park. In S.-C. Khoo & J. Siek (Eds.), Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation (pp. 1-12). Association for Computing Machinery. https://doi.org/10.1145/1929501.1929503

Displaying results 3001 to 3050 out of 6000

Revised 01.09.2025

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University