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

Mascheroni, G., Zaman, B., Eriksson, E., Cino, D., Brandsen, S. & Bressa, N. A. (2022). Towards Computational Empowerment of Disadvantaged Children and Youth in Non-Formal Learning Contexts. Abstract fra ICA annual conference, Paris, Frankrig.

Radaelli, L. & Jensen, C. S. (2015). Towards Characterizing the Temporal Aspect of Frequent Patterns in Indoor Trajectory Data.

Hubenschmid, S., Zagermann, J., Fink, D., Wieland, J., Feuchtner, T. & Reiterer, H. (2021). Towards Asynchronous Hybrid User Interfaces for Cross-Reality Interaction. I H.-C. Jetter, J.-H. Schröder, J. Gugenheimer, M. Billinghurst, C. Anthes, M. Khamis & T. Feuchtner (red.), ISS'21 Workshop Proceedings: Transitional Interfaces in Mixed and Cross-Reality: A new frontier? https://doi.org/10.18148/kops/352-2-84mm0sggczq02

Hansen, K. M., Ingstrup, M., Kyng, M. & Olsen, J. W. (2011). Towards a Software Ecosystem of Healthcare Services. I Proceedings of the 3rd International Workshop on Infrastructures for Healthcare: Global Healthcare (s. 27-30) http://www.itu.dk/people/lrc/ProcInfraHealth2011.PDF

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

Thiel, S.-K., Remy, C., Roque, L., Orji, R., Dalsgaard, P., Latulipe, C. & Sarcar, S. (2019). Towards a Research Agenda for Gameful Creativity. I DIS 2019 Companion - Companion Publication of the 2019 ACM Designing Interactive Systems Conference (s. 393-396). Association for Computing Machinery. https://doi.org/10.1145/3301019.3320003

Klokmose, C. N. (2007). Towards an Instrumental Paradigm for Ubiquitous Interaction. I A. C. Brodersen, S. Bødker & C. N. Klokmose (red.), Multiple and Ubiquitous Interaction, 28. - 30. March 2007: Book of Abstracts (s. 33-35)

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

Kaspersen, M. H., Graungaard, D., Bouvin, N. O., Petersen, M. G. & Eriksson, E. (2021). Towards a model of progression in computational empowerment in education. International Journal of Child - Computer Interaction, 29, Artikel 100302. https://doi.org/10.1016/j.ijcci.2021.100302

Asharov, G., Canetti, R. & Hazay, C. (2011). Towards a Game Theoretic View of Secure Computation. Lecture Notes in Computer Science, 426-445. https://doi.org/10.1007/978-3-642-20465-4_24

Aehnelt, M., Schulz, H.-J. & Urban, B. (2013). Towards a Contextualized Visual Analysis of Heterogeneous Manufacturing Data. I Advances in Visual Computing : 9th International Symposium, ISVC 2013, Rethymnon, Crete, Greece, July 29-31, 2013. Proceedings, Part II (s. 76-85). Springer. https://doi.org/10.1007/978-3-642-41939-3_8

Saad-Sulonen, J. & Korsgaard, H. (2015). Towards a concept of community artifact ecology in HCI?. Afhandling præsenteret på CHI, Seoul, Sydkorea.

Korsgaard, H. (2017). Toward Place-Centric Computing: Making Place With Technology Together.

Yang, B., Guo, C., Ma, Y. & Jensen, C. S. (2015). Toward personalized, context-aware routing. V L D B Journal, 24(2), 297-318. https://doi.org/10.1007/s00778-015-0378-1

Schäfer, Z., Mathisen, A., Svendsen, K., Engberg, S., Rolighed Thomsen, T. & Kirketerp-Møller, K. (2021). Toward Machine-Learning-Based Decision Support in Diabetes Care: A Risk Stratification Study on Diabetic Foot Ulcer and Amputation. Frontiers in medicine, 7, Artikel 601602. https://doi.org/10.3389/fmed.2020.601602

Brewer, R. S., Verdezoto, N., Holst, T. & Rasmussen, M. K. (2015). Tough Shift: Exploring the Complexities of Shifting Residential Electricity Use Through a Casual Mobile Game. I CHI PLAY '15 : Proceedings of the 2015 Annual Symposium on Computer-Human Interaction in Play (s. 307-317). Association for Computing Machinery. https://doi.org/10.1145/2793107.2793108

Pagnin, E., Gunnarsson, G., Talebi, P., Orlandi, C. & Sabelfeld, A. (2019). TOPPool: Time-aware Optimized Privacy-Preserving Ridesharing. Proceedings on Privacy Enhancing Technologies, 2019(4), 93-111. https://doi.org/10.2478/popets-2019-0060

LaVigne, R., Liu-Zhang, C.-D., Maurer, U. M., Moran, T., Mularczyk, M. & Tschudi, D. (2018). Topology-Hiding Computation Beyond Semi-Honest Adversaries. I A. Beimel & S. Dziembowski (red.), Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings: Theory of Cryptography (Bind 11240, s. 3-35). Springer VS. https://doi.org/10.1007/978-3-030-03810-6_1

Moeslund, J. E., Arge, L., Bøcher, P. K., Dalgaard, T., Odgaard, M. V., Nygaard, B. & Svenning, J.-C. (2013). Topographically controlled soil moisture is the primary driver of local vegetation patterns across a lowland region. Ecosphere (Washington, D.C.), 4(7), Artikel 91. https://doi.org/10.1890/ES13-00134.1

Munro, J. I., Navarro, G., Nielsen, J. A. S. & ShaH, R. (2014). Top- k Term-Proximity in Succinct Space. I H.-K. Ahn & C.-S. Shin (red.), Algorithms and Computation: 25th International Symposium, ISAAC 2014, Proceedings (s. 169-180 ). Springer VS. https://doi.org/10.1007/978-3-319-13075-0_14

Skovsgaard, A. & Jensen, C. S. (2014). Top-k point of interest retrieval using standard indexes. I Y. Huang & M. Schneider (red.), Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL '14 (s. 173-182 ). Association for Computing Machinery. https://doi.org/10.1145/2666310.2666399

Kjærgaard, M. B. & Blunck, H. (2014). Tool support for detection and analysis of following and leadership behavior of pedestrians from mobile sensing data. Pervasive and Mobile Computing, 10(A), 104-117. https://doi.org/10.1016/j.pmcj.2013.10.007

Blatchley Hansen, A., Eskilden, M. & Nielsen, E. H. (2020). Toolchain for Timing Leakage Analysis of NIST Lightweight Crypto Candidates. Abstract fra NIST Lightweight Cryptography Workshop 2020. https://csrc.nist.gov/CSRC/media/Events/lightweight-cryptography-workshop-2020/documents/papers/toolchain-timing-leakage-lwc2020.pdf

Christensen, P. K., Skovgaard, C. Ø. & Petersen, M. G. (2019). Together together: Combining shared and separate activities in designing technology for family life. I Proceedings of the 18th ACM International Conference on Interaction Design and Children, IDC 2019 (s. 374-385). Association for Computing Machinery. https://doi.org/10.1145/3311927.3323141

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

Nasir, M. A. U., Aslay, C., de Francisi Morales, G. & Riondato, M. (2021). TipTap: Approximate Mining of Frequent k-Subgraph Patterns in Evolving Graphs. ACM Transactions on Knowledge Discovery from Data, 15(3), 1-35. Artikel 48. https://doi.org/10.1145/3442590

Döttling, N. M., Ghosh, S., Nielsen, J. B., Nilges, T. & Trifiletti, R. (2017). TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation. I CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security: CCS '17 (s. 2263-2276). Association for Computing Machinery. https://doi.org/10.1145/3133956.3134024

Trifiletti, R., Nielsen, J. B., Jakobsen, T. P. & Frederiksen, T. K. (2015, apr. 3). TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-Party Computation. https://eprint.iacr.org/2015/309.pdf

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2018). TinyKeys: A New Approach to Efficient Multi-Party Computation. I H. Shacham & A. Boldyreva (red.), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (Bind 10993, s. 3-33). Springer VS. https://doi.org/10.1007/978-3-319-96878-0_1

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2022). TinyKeys: A New Approach to Efficient Multi-Party Computation. Journal of Cryptology, 35(2), Artikel 13. https://doi.org/10.1007/s00145-022-09423-5

Hansen, M. T. & Kusy, B. (2011). TinyInventor: A Holistic Approach to Sensor Network Application Development. Afhandling præsenteret på Extending the Internet to Low power and Lossy Networks. IP+SN 2011 , Chicago, IL, USA.

Hansen, M. T. (2011). TinyDebug: Multi-Purpose Passive Debugging Framework for Embedded Wireless Systems. D A I M I P B, (595).

Nyborg, J. C., Pelletier, C., Lefevre, S. & Assent, I. (2022). TimeMatch: Unsupervised Cross-Region Adaptation by Temporal Shift Estimation. ISPRS Journal of Photogrammetry and Remote Sensing, 188, 301-313. https://doi.org/10.1016/j.isprsjprs.2022.04.018

Larsen, K. G., Nelson, J. & Nguyen, H. L. (2015). Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms. I R. Servedio & R. Rubinfeld (red.), Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC '15 (s. 803-812). Association for Computing Machinery. https://doi.org/10.1145/2746539.2746542

Kjærgaard, M. B., Blunck, H., Wüstenberg, M., Grønbæk, K., Wirz, M., Roggen, D. & Tröster, G. (2013). Time-lag Method for Detecting Following and Leadership Behavior of Pedestrians from Mobile Sensing Data. I IEEE International Conference on Pervasive Computing and Communications (PerCom), 2013 (s. 56 - 64 ). IEEE. https://doi.org/10.1109/PerCom.2013.6526714

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

Gál, A., Hansen, K. A., Koucký, M., Pudlák, P. & Viola, E. (2011). Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electronic Colloquium on Computational Complexity, 18(150). http://eccc.hpi-web.de/report/2011/150/

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

Gal, A., Hansen, K. A., Koucky, M., Pudlak, P. & Viola, E. (2013). Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. I E E E Transactions on Information Theory, 59(10), 6611-6627. https://doi.org/10.1109/TIT.2013.2270275

Hansen, J. C., Kjelstrøm, A. H. & Pavlogiannis, A. (2021). Tight bounds for reachability problems on one-counter and pushdown systems. Information Processing Letters, 171, Artikel 106135. https://doi.org/10.1016/j.ipl.2021.106135

Woodruff, D. P. & Zhang, Q. (2011). Tight Bounds for Distributed Functional Monitoring. http://arxiv.org/abs/1112.5153

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

Melissaris Papanikolaou, N., Ravi, D. & Yakoubov, S. (2024). Threshold-Optimal MPC With Friends and Foes. I A. Chattopadhyay, S. Bhasin, S. Picek & C. Rebeiro (red.), Progress in Cryptology – INDOCRYPT 2023: 24th International Conference on Cryptology in India, Goa, India, December 10–13, 2023, Proceedings, Part II (Bind 2, s. 3-24). Springer. https://doi.org/10.1007/978-3-031-56235-8_1

Doerner, J., Kondi, Y., Lee, E., Shelat, A. & Tyner, L. (2023). Threshold BBS+ Signatures for Distributed Anonymous Credential Issuance. I 44th IEEE Symposium on Security and Privacy, SP 2023, San Francisco, CA, USA, May 21-25, 2023 (s. 773-789). IEEE. https://doi.org/10.1109/SP46215.2023.10179470

Danvy, O. & Zerny, I. (2011). Three Syntactic Theories for Combinatory Graph Reduction. Lecture Notes in Computer Science, 6564, 1-20. https://doi.org/10.1007/978-3-642-20551-4_1

Danvy, O. & Zerny, I. (2013). Three Syntactic Theories for Combinatory Graph Reduction. A C M Transactions on Computational Logic, 14(4), Artikel 29. https://doi.org/10.1145/2528932

Jørgensen, A. G. & Pettie, S. (2014). Threesomes, Degenerates, and Love Triangles. I B. Barak (red.), 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, FOCS (s. 621-630). IEEE Computer Society Press. https://doi.org/10.1109/FOCS.2014.72

Grønlund, A. & Pettie, S. (2018). Threesomes, degenerates, and love triangles. Journal of the ACM, 65(4), Artikel 22. https://doi.org/10.1145/3185378

Brewer, R. S., Xu, Y., Lee, G. E., Katchuck, M., Moore, C. A. & Johnson, P. M. (2013). Three Principles for the Design of Energy Feedback Visualizations. International Journal On Advances in Intelligent Systems, 6(3 & 4), 188-198. http://csdl.ics.hawaii.edu/techreports/2013/13-05/13-05.pdf

Sidlauskas, D., Ross, K. A., Jensen, C. S. & Saltenis, S. (2011). Thread-Level Parallel Indexing of Update Intensive Moving-Object Workloads. Lecture Notes in Computer Science, 6849, 186-204. https://doi.org/10.1007/978-3-642-22922-0_12

Viser resultater 251 til 300 ud af 2930

Forrige

Næste

Revideret 09.03.2023

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series