Aarhus Universitets segl

Publikationer

Søg publikationer fra Institut for Datalogi

Liste over publikationer af videnskabelige medarbejdere fra Institut for Datalogi, Aarhus Universitet.

Sortér efter: Dato | Forfatter | Titel

Miltersen, P. B. & Sheffet, O. (2012). Send mixed signals : earn more, work less. I B. Faltings, K. Leyton-Brown & P. Ipeirotis (red.), EC '12 Proceedings of the 13th ACM Conference on Electronic Commerce (s. 234-247). Association for Computing Machinery. https://doi.org/10.1145/2229012.2229033
Rasmussen, M. K., Pedersen, E. W., Petersen, M. G. & Hornbæk, K. A. S. (2012). Shape-changing interfaces: a review of the design space and open research questions. I CHI '12 : Proceedings of the SIGCHI Conference on Human Factors in Computing Systems (s. 735-744 ). Association for Computing Machinery. https://doi.org/10.1145/2212776.2212798
Cao, X., Chen, L., Cong, G., Jensen, C. S., Qu, Q., Skovsgaard, A., Wu, D. & Yiu, M. L. (2012). Spatial Keyword Querying: Invited Paper. Lecture Notes in Computer Science, 7532, 16-29 . https://doi.org/10.1007/978-3-642-34002-4_2
Micenková, B., van Beusekom, J. & Shafait, F. (2012). Stamp Verification for Automated Document Authentication. Afhandling præsenteret på International Workshop on Computational Forensics , Tsukuba, Japan.
Hachisuka, T., Jarosz, W., Bouchard , G., Christensen, P., Frisvad, J. R., Wenzel, J., Henrik Wann, J., Kaschalk, M., Knaus, C., Selle, A. & Spencer, B. (2012). State of the Art in Photon-Density Estimation: Course notes. I SIGGRAPH '12 ACM SIGGRAPH 2012 Courses Association for Computing Machinery. https://doi.org/10.1145/2343483.2343489
Bhatacharya, H., Nielsen, M. B. & Bridson, R. (2012). Steady State Stokes Flow Interpolation for Fluid Control. Annual Conference of the European Association for Computer Graphics , 33, 57-60. https://doi.org/10.2312/conf/EG2012/short/057-060
Lex, A., Streit, M., Schulz, H.-J., Partl, C., Schmalstieg, D., Park, P. J. & Gehlenborg, N. (2012). StratomeX: Visual Analysis of Large-Scale Heterogeneous Genomics Data for Cancer Subtype Characterization. Computer Graphics Forum, 31(3), 1175-1184. https://doi.org/10.1111/j.1467-8659.2012.03110.x
Brodal, G. S., Lagogiannis, G. & Tarjan, R. E. (2012). Strict fibonacci heaps. I STOC '12 Proceedings of the 44th symposium on Theory of Computing (s. 1177-1184 ). Association for Computing Machinery. https://doi.org/10.1145/2213977.2214082
Davoodi, P., Raman, R. & Satti, S. (2012). Succinct Representations of Binary Trees for Range Minimum Queries. Lecture Notes in Computer Science, 7434, 396-407 . https://doi.org/10.1007/978-3-642-32241-9_34
Cao, X., Cong, G., Jensen, C. S., NG, J. J., Ooi, B. C., Phan, N.-T. & Wu, D. (2012). SWORS: a system for the efficient retrieval of relevant spatial web objects. Proceedings of the VLDB Endowment, 5(12), 1914-1917. http://dl.acm.org/citation.cfm?id=2367536
Gamberini, L., Spagnolli, A., Corradi, N., Jacucci, G., Tusa, G., Mikkola, T., Zamboni, L. & Hoggan, E. (2012). Tailoring feedback to users’ actions in a persuasive game for household electricity conservation. I International Conference on Persuasive Technology (s. 100-111)
Korn, M. & Back, J. (2012). Talking it Further: From Feelings and Memories to Civic Discussions In and About Places. I L. Malmborg & T. Pederson (red.), NordiCHI '12 Proceedings of the 7th Nordic Conference on Human-Computer Interaction: Making Sense Through Design (s. 189-198). Association for Computing Machinery. https://doi.org/10.1145/2399016.2399046
Reetz, E., Lehmann, A., Kümper, D. & Tönjes, R. (2012). Test Driven Life Cycle Management for Internet of Things based Services: a Semantic Approach. Afhandling præsenteret på International Conference on Advances in System Testing and Validation Lifecycle, Lisbon, Portugal.
Larsen, K. G. (2012). The Cell Probe Complexity of Dynamic Range Counting. I STOC’12 : Proceedings of the 44th symposium on Theory of Computing (s. 85-94). Association for Computing Machinery. https://doi.org/10.1145/2213977.2213987
Tominski, C. & Schulz, H.-J. (2012). The Great Wall of Space-Time. I T. Grosch, B. Preim, H. Theisel & K.-D. Toennies (red.), Proceedings of the Workshop on Vision, Modeling, and Visualization (VMV) (s. 199-206). Eurographics Association. https://doi.org/10.2312/PE/VMV/VMV12/199-206
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
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. I Proceedings of the 2012 ACM Symposium on Theory of Computing, STOC’12 (s. 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. I H. Karloff & T. Pitassi (red.), STOC '12 Proceedings of the 44th symposium on Theory of Computing (s. 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. I Proceedings of the 2012 ACM Symposium on Theory of Computing, STOC’12 (s. 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. I R. L. Constable & A. Silva (red.), Logic and Program Semantics : Essays Dedicated to Dexter Kozen on the Occasion of His 60th Birthday (s. 341). Springer. https://doi.org/10.1007/978-3-642-29485-3_30
Andersen, M. S. & Kjærgaard, M. B. (2012). Towards a New Classification of Location Privacy Methods in Pervasive Computing. I A. Puiatti & T. Gu (red.), Mobile and Ubiquitous Systems: Computing, Networking, and Services : 8th International ICST Conference, MobiQuitous 2011, Copenhagen, Denmark, December 6-9, 2011, Revised Selected Papers (Bind 104, s. 150-161). Springer. https://doi.org/10.1007/978-3-642-30973-1_13
Jensen, K., Donatelli, S. & Kleijn , J. (red.) (2012). Transactions on Petri Nets and Other Models of Concurrency V: ToPNoC. Springer. Lecture Notes in Computer Science Bind 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. (red.) (2012). Transactions on Petri Nets and Other Models of Concurrency VI: ToPNoC. Springer. Lecture Notes in Computer Science Bind 7400 https://doi.org/10.1007/978-3-642-35179-2
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
Vermeulen, J., Luyten, K. & Coninx, K. (2012). Understanding Complex Environments with the Feedforward Torch. I Ambient Intelligence - Third International Joint Conference, AmI 2012, Pisa, Italy, November 13-15, 2012. Proceedings (s. 312-319) https://doi.org/10.1007/978-3-642-34898-3_22