Publikationer

Søg publikationer fra Institut for Datalogi

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

Abboud, A., Backurs, A., Hansen, T. D., Williams, V. V. & Zamir, O. (2016). Subtree isomorphism revisited. I 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016 (Bind 2, s. 1256-1271). Association for Computing Machinery.

Nielsen, M., Brewer, R. S. & Grønbæk, K. (2016). Supporting interactive visual analytics of energy behavior in buildings through affine visualizations. I Proceedings of the 28th Australian Computer-Human Interaction Conference, OzCHI 2016 (s. 238-247). Association for Computing Machinery. https://doi.org/10.1145/3010915.3010950

Stisen, A., Mathisen, A., Krogh, S., Blunck, H., Kjærgaard, M. B. & Prentow, T. S. (2016). Task Phase Recognition for Highly Mobile Workers in Large Building Complexes. I 2016 IEEE International Conference on Pervasive Computing and Communications, PerCom 2016 Artikel 7456504 IEEE. https://doi.org/10.1109/PERCOM.2016.7456504

Christensen, H. B. (2016). Teaching DevOps and Cloud Computing using a Cognitive Apprenticeship and Story-Telling Approach. I ITiCSE 2016 - Proceedings of the 2016 ACM Conference on Innovation and Technology in Computer Science Education (s. 174-179). Association for Computing Machinery. https://doi.org/10.1145/2899415.2899426

Hansen, K. A., Ibsen-Jensen, R. & Koucký, M. (2016). The big match in small space. I M. Gairing & R. Savani (red.), Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings (Bind 9928, s. 64-76). Springer VS. https://doi.org/10.1007/978-3-662-53354-3_6

Madsen, O. L. & Møller-Pedersen, B. (2016). The Essence of Subclassing. Afhandling præsenteret på NOOL 2016, Amsterdam, Holland.

Garg, S., Mukherjee, P., Pandey, O. & Polychroniadou, A. (2016). The Exact Round Complexity of Secure Computation. I M. Fischlin & J.-S. Coron (red.), Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (s. 448 - 476). Springer VS. https://doi.org/10.1007/978-3-662-49896-5

Clouston, R., Bizjak, A., Grathwohl, H. B. & Birkedal, L. (2016). The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types. Logical Methods in Computer Science, 12(3), 1 - 39.

Dithmer, M., Rasmussen, J. O., Grönvall, E., Spindler, H., Hansen, J., Nielsen, G., Sørensen, S. B. & Dinesen, B. (2016). "The Heart Game": Using Gamification as Part of a Telerehabilitation Program for Heart Patients. Games for Health, 5(1), 27-33. https://doi.org/10.1089/g4h.2015.0001

Bauer, A., Gross, J., Lumsdaine, P. L., Shulman, M., Sozeau, M. & Spitters, B. (2016). The HoTT Library: A formalization of homotopy type theory in Coq. http://arxiv.org/abs/1610.04591

Larsen, K. G. & Nelson, J. (2016). The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction. Leibniz International Proceedings in Informatics, 55, 82:1 - 82:11. https://doi.org/10.4230/LIPIcs.ICALP.2016.82

Schwiegelshohn, C. & Schwiegelshohn, U. (2016). The power of migration for online slack scheduling. I C. Zaroliagis & P. Sankowski (red.), 24th Annual European Symposium on Algorithms, ESA 2016 Artikel 75 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2016.75

Brody, J. E., Buhrman, H., Koucký, M., Loff, B. & Speelman, F. (2016). Towards a Reverse Newman's Theorem in Interactive Information Complexity. Algorithmica, 76(3), 749-781. https://doi.org/10.1007/s00453-015-0112-9

Baum, C. (2016). Towards More Efficient Secure Multiparty Computation in the Preprocessing Model. Department of Computer Science, Aarhus University.

Grønlund, A. & Larsen, K. G. (2016). Towards Tight Lower Bounds for Range Reporting on the RAM. Leibniz International Proceedings in Informatics, 55, 92:1 - 92:12. https://doi.org/10.4230/LIPIcs.ICALP.2016.92

Andreasen, E. S., Gordon, C. S., Chandra, S., Sridharan, M., Tip, F. & Sen, K. (2016). Trace Typing: An Approach for Evaluating Retrofitted Type Systems. I S. Krishnamurthi & B. S. Lerner (red.), 30th European Conference on Object-Oriented Programming (ECOOP 2016) (s. 231-239, 2310-2328). Dagstuhl Publishing. http://arxiv.org/abs/1605.01362

Svendsen, K., Sieczkowski, F. & Birkedal, L. (2016). Transfinite step-indexing: Decoupling concrete and logical steps. I P. Thiemann (red.), Programming Languages and Systems (Bind 9632, s. 727-751). Springer VS. https://doi.org/10.1007/978-3-662-49498-1_28

Caragiannis, I., Filos-Ratsikas, A., Frederiksen, S. K. S., Hansen, K. A. & Tan, Z. (2016). Truthful facility assignment with resource augmentation: An exact analysis of serial dictatorship. I Web and Internet Economics - 12th International Conference, WINE 2016, Proceedings (Bind 10123, s. 236-250). Springer VS. https://doi.org/10.1007/978-3-662-54110-4_17

Heinze, T. S., Møller, A. & Strocco, F. (2016). Type safety analysis for dart. I R. Ierusalimschy (red.), DLS 2016 - Proceedings of the 12th Symposium on Dynamic Languages (s. 1-12). Association for Computing Machinery. https://doi.org/10.1145/2989225.2989226

Strocco, F. (2016). Type Soundness in the Dart Programming Language. Department of Computer Science, University of Aarhus.

Mezzetti, G., Møller, A. & Strocco, F. (2016). Type unsoundness in practice: An empirical study of dart. I R. Ierusalimschy (red.), DLS 2016 - Proceedings of the 12th Symposium on Dynamic Languages (s. 13-24). Association for Computing Machinery. https://doi.org/10.1145/2989225.2989227

Damgård, I., Nielsen, J. B., Ostrovsky, R. & Rosén, A. (2016). Unconditionally secure computation with reduced interaction. I M. Fischlin & J.-S. Coron (red.), Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (Bind 9666, s. 420-447). Springer VS. https://doi.org/10.1007/978-3-662-49896-5_15

Tsirogiannis, C. & Tsirogiannis, C. (2016). Uncovering the Hidden Routes: Algorithms for Identifying Paths and Missing Links in Trade Networks . I T. Brughmans, A. Collar & F. Coward (red.), The Connected Past: Challenges to Network Studies in Archaeology and History Oxford University Press.

Mechler, J., Müller-Quade, J. & Nilges, T. (2016). Universally Composable (Non-Interactive) Two-Party Computation from Untrusted Reusable Hardware Tokens. http://eprint.iacr.org/2016/615

Čermák, J., Bosansky, B., Durkota, K., Lisý, V. & Kiekintveld, C. (2016). Using correlated strategies for computing stackelberg equilibria in extensive-form games. I 30th AAAI Conference on Artificial Intelligence, AAAI 2016 (s. 439-445). AAAI Press. https://www.scopus.com/inward/record.uri?eid=2-s2.0-85007242893&partnerID=40&md5=d6d209b2094ebcd4dd19608badb7e971

Lehmann, A. & Gross, A. (2016). Using Crowd Sensed Data as Input to Congestion Model. I 2016 IEEE International Conference on Pervasive Computing and Communication Workshops, PerCom Workshops 2016: The Third International Workshop on Crowd Assisted Sensing Pervasive Systems and Communications Artikel 7457105 IEEE Press. https://doi.org/10.1109/PERCOMW.2016.7457105

Jørgensen, J. B., Knudsen, B., Sloth, L., Vase, J. R. & Christensen, H. B. (2016). Variability Handling for Mobile Banking Apps on iOS and Android. I Proceedings - 2016 13th Working IEEE/IFIP Conference on Software Architecture, WICSA 2016 (s. 283-286). Artikel 7516847 IEEE Computer Society Press. https://doi.org/10.1109/WICSA.2016.29

Dodds, M., Jagannathan, S., Parkinson, M. J., Svendsen, K. & Birkedal, L. (2016). Verifying custom synchronisation constructs using higher-order separation logic. ACM Transactions on Programming Languages and Systems, 38/2(2), 4:1 - 4:72. Artikel 4. https://doi.org/10.1145/2818638

Klokmose, C. N., Eagan, J., Baader, S., Mackay, W. & Beaudouin-Lafon, M. (2016). Webstrates: Demonstrating the potential of shareable dynamic media. I Proceedings of the 19th ACM Conference on Computer Supported Cooperative Work and Social Computing Companion, CSCW 2016 Companion: CSCW '16 Companion (s. 61-64). Association for Computing Machinery. https://doi.org/10.1145/2818052.2874325

Zagermann, J., Pfeil, U., Rädle, R., Jetter, H.-C., Klokmose, C. N. & Reiterer, H. (2016). When Tablets meet Tabletops: The Effect of Tabletop Size on Around-the-Table Collaboration with Personal Tablets. I CHI '16: Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems (s. 5470-5481). Association for Computing Machinery. https://doi.org/10.1145/2858036.2858224

Salgado, M. & Saad-Sulonen, J. (2016). Who needs us? Inquiring into the participatory practices of others and what it means for participatory designers. Afhandling præsenteret på International European Academy of Design Conference, Paris, Frankrig.

Giacomelli, I., Madsen, J. & Orlandi, C. (2016). ZKBoo: Faster Zero-Knowledge for Boolean Circuits. I Proceedings of the 25th USENIX Security Symposium: (USENIX Security 16) (s. 1069-1083). USENIX - The Advanced Computing Systems Association. https://www.usenix.org/system/files/conference/usenixsecurity16/sec16_paper_giacomelli.pdf

Danvy, O. (red.) (2015). 2015 Workshop on Continuations: pre-proceedings. Department of Computer Science, University of Aarhus. https://doi.org/10.7146/aul.4.4

Elkin , M., Pettie, S. & Su, H.-H. (2015). (2Δ − 1)-edge-coloring is much easier than maximal matching in the distributed setting. I P. Indyk (red.), Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '15 (s. 355-370 ). Society for Industrial and Applied Mathematics. http://dl.acm.org/citation.cfm?id=2722155

Christensen, A. S., Midtgaard, J., Winther, J. & Zerny, I. (2015). A Case Study in Modular Programming: Using AspectJ and OCaml in an Undergraduate Compiler Project. Department of Computer Science, University of Aarhus. https://doi.org/10.7146/aul.6.7

Brody, J. E. & Larsen, K. G. (2015). Adapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures. Theory of Computing, 11(19), 471-489. https://doi.org/10.4086/toc.2015.v011a019

Cascudo Pueyo, I., Damgård, I. B., David, B. M., Giacomelli, I., Nielsen, J. B. & Trifiletti, R. (2015). Additively Homomorphic UC commitments with Optimal Amortized Overhead. I J. Katz (red.), Public-Key Cryptography, PKC 2015: 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30-April 1, 2015, Proceedings (s. 495–515). Springer. https://doi.org/10.1007/978-3-662-46447-2_22

Bødker, S. & Klokmose, C. N. (2015). A dialectical take on artifact ecologies and the physical - digital divide. Afhandling præsenteret på CHI Workshop on Ecological Perspectives in HCI, Sydkorea. http://rizzo.media.unisi.it/EPCHI2015/resources/papers/A-dialectical-take-on-artifact-ecologies.pdf

Branzei, S. & Miltersen, P. B. (2015). A Dictatorship Theorem for Cake Cutting. I Q. Yang & M. Wooldridge (red.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) (s. 481-488). AAAI Press. http://ijcai.org/papers15/Papers/IJCAI15-074.pdf

Biernacki, D., Danvy, O. & Millikin, K. (2015). A dynamic continuation-passing style for dynamic delimited continuations. A C M Transactions on Programming Languages and Systems, 38(1), Artikel 2. https://doi.org/10.1145/2794078

Dang, X. H. & Bailey, J. (2015). A framework to uncover multiple alternative clusterings. Machine Learning, 98(1-2), 7-30. https://doi.org/10.1007/s10994-013-5338-7

Elkin , M. & Pettie, S. (2015). A linear-size logarithmic stretch path-reporting distance oracle for general graphs. I P. Indyk (red.), SODA '15 Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (s. 805-821 ). Society for Industrial and Applied Mathematics. http://dl.acm.org/citation.cfm?id=2722129.2722184&coll=DL&dl=ACM&CFID=630471957&CFTOKEN=95259129

Jespersen, S., Stounbjerg, R. B. K. & Verdezoto, N. (2015). AmBird: Mediating Intimacy for Long Distance Relationships through an Ambient Awareness System. I O. W. Bertelsen & K. Halskov (red.), Critical Alternatives, 5th decennial Aarhus Conference: conference proceedings, conference papers. Department of Computer Science, Aarhus University. https://doi.org/10.7146/aahcc.v1i1.21321

Bizjak, A. & Møgelberg, R. E. (2015). A model of guarded recursion with clock synchronisation. Electronic Notes in Theoretical Computer Science, 319, 83-101. https://doi.org/10.1016/j.entcs.2015.12.007

Paviotti, M., Møgelberg, R. E. & Birkedal, L. (2015). A model of PCF in guarded type theory. Electronic Notes in Theoretical Computer Science, 319, 333–349. https://doi.org/10.1016/j.entcs.2015.12.020

Walter, R., Bulling, A., Lindlbauer, D., Schuessler , M. & Müller, J. (2015). Analyzing visual attention during whole body interaction with public displays. I Proceedings of the 2015 ACM International Joint Conference on Pervasive and Ubiquitous Computing, UbiComp '15 (s. 1263-1267). Association for Computing Machinery. https://doi.org/10.1145/2750858.2804255

Caragiannis, I., Filos-Ratsikas, A. & Procaccia, A. D. (2015). An improved 2-agent kidney exchange mechanism. Theoretical Computer Science, 589, 53–60. https://doi.org/10.1016/j.tcs.2015.04.013

Branzei, S. (2015). A note on envy-free cake cutting with polynomial valuations. Information Processing Letters, 115(2), 93-95. https://doi.org/10.1016/j.ipl.2014.07.005

Wagner, S. R., Bertelsen, O. W. & Toftegaard, T. S. (2015). Applicability of the Reliable Evaluation Infrastructure Toolkit for Facilitating Self-Care Research. Journal of Pervasive Systems Engineering, 4(1). http://pervasivesystems.org/Papers/2015-1/Article%20-%20APPLICABILITY%20OF%20THE%20RELIABLE%20EVALUATION%20INFRASTRUCTURE%20TOOLKIT%20FOR%20FACILITATING%20SELF-CARE%20RESEARCH%20.pdf

Goswami, M., Jørgensen, A. G., Larsen, K. G. & Pagh, R. (2015). Approximate Range Emptiness in Constant Time and Optimal Space. I Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '15 (s. 769-775). Society for Industrial and Applied Mathematics. http://dl.acm.org/citation.cfm?id=2133036&picked=prox

Viser resultater 1751 til 1800 ud af 2969

Forrige