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

Bui, T. L., Chatterjee, K., Gautam, T., Pavlogiannis, A. & Toman, V. (2021). The reads-from equivalence for the TSO and PSO memory models. Proceedings of the ACM on Programming Languages , 5(OOPSLA), Artikel 164. https://doi.org/10.1145/3485541

Bui, D., Couteau, G., Meyer, P., Passelègue, A. & Riahinia, M. (2024). Fast Public-Key Silent OT and More from Constrained Naor-Reingold. I M. Joye & G. Leander (red.), Advances in Cryptology – EUROCRYPT 2024 (s. 88-118). Springer. https://doi.org/10.1007/978-3-031-58751-1_4

Buemann, B., Schierning, B., Toubro, S., Bibby, B. M., Sørensen, T., Dalgaard, L., Pedersen, O. & Astrup, A. (2001). The association between the val/ala-55 polymorphism of the uncoupling protein 2 gene and exercise efficiency. International Journal of Obesity, 25(4), 467-471. https://doi.org/10.1038/sj.ijo.0801564

Buch, J., Etches, A., Nielsen, K., Musaeus, L. H. & Hjorth, H. A. (2019). Computational Thinking i Matematik og Naturvidenskab: Evaluering af kursusforløbet efter det første gennemløb 2018-2019. Rapport udarbejdet for Danske Science Gymnasier (DASG) af Center for Computational Thinking & Design, Aarhus Universitet. https://science-gym.dk/evaluer/CTiMNAT-evaluering-20182019.pdf

Bucarelli, M. S., Larsen, M. F., Schwiegelshohn, C. & Toftrup, M. B. (2023). On Generalization Bounds for Projective Clustering.

Bucarelli, M. S., Larsen, M. F., Schwiegelshohn, C. & Toftrup, M. B. (2023). On Generalization Bounds for Projective Clustering. I Advances in Neural Information Processing Systems https://papers.nips.cc/paper_files/paper/2023/hash/e30bf4765ae6b16a87fb4d7b0b3b3dec-Abstract-Conference.html

Brzuska, C., Couteau, G., Egger, C., Karanko, P. & Meyer, P. E. (2024). Instantiating the Hash-Then-Evaluate Paradigm: Strengthening PRFs, PCFs, and OPRFs. I C. Galdi & D. Hieu Phan (red.), Security and Cryptography for Networks (s. 97–116). Springer Nature. https://eprint.iacr.org/2023/1145

Brynskov, M., Bermúdez, J. C. C., Fernández, M., Korsgaard, H., Mulder, I., Piskorek, K., Rekow, L. & de Waal, M. (2014). Urban Interaction Design: Towards City Making. Urban IxD Booksprint. http://static1.squarespace.com/static/50f5c859e4b083caad2ed6a0/t/5395d6a5e4b0fc0456d8d5a3/1402328741769/UrbanIxD_towardsCityMaking.pdf

Brueggemann, M. J., Strohmayer, A., Marshall, M., Birbeck, N. & Thomas, V. (2017). Reflexive Practices for the Future of Design Education: An Exercise in Ethno-Empathy. Information Design Journal, 20(sup1), S1260-S1269. https://doi.org/10.1080/14606925.2017.1352655

Brueggemann, M. J., Thomas, V. & Wang, D. (2018). Lickable cities: Lick everything in sight and on site. I R. Mandryk, M. Hancock, M. Perry & A. Cox (red.), CHI 2018 - Extended Abstracts of the 2018 CHI Conference on Human Factors in Computing Systems: Engage with CHI (s. 1-11). Artikel alt06 Association for Computing Machinery. https://doi.org/10.1145/3170427.3188399

Brudy, F., Holz, C., Rädle, R., Wu, C. J., Houben, S., Klokmose, C. N. & Marquardt, N. (2019). Cross-device taxonomy: Survey, opportunities and challenges of interactions spanning across multiple devices. I CHI 2019 - Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems Association for Computing Machinery. https://doi.org/10.1145/3290605.3300792

Brucato, M., Derczynski, L., Llorens, H., Bontcheva, K. & Jensen, C. S. (2013). Recognising and Interpreting Named Temporal Expressions. I G. Angelova, K. Bontcheva & R. Mitkov (red.), Proceedings of Recent Advances in Natural Language Processing (s. 113-122). INCOMA Ltd. http://lml.bas.bg/ranlp2013/history.php

Brown, B., Bødker, S. & Höök, K. (2017). Does HCI Scale?: Scale Hacking and the Relevance of HCI. interactions, 24(5), 28-33. https://doi.org/10.1145/3125387

Brody, J. E., Liang, H. & Sun, X. (2012). Space-Efficient Approximation Scheme for Circular Earth Mover Distance. Lecture Notes in Computer Science, 7256, 97-108. https://doi.org/10.1007/978-3-642-29344-3_9

Brody, J. E., Chakrabarti, A., McGregor, A. & Kondapally, R. (2012). Certifying Equality With Limited Interaction. Electronic Colloquium on Computational Complexity, (TR12-153 ). http://eccc.hpi-web.de/report/2012/153/

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

Brody, J. E., Chen, S., Papakonstantinou , P. A., Song, H. & Sun, X. (2013). Space-bounded communication complexity. I Proceedings of the 4th conference on Innovations in Theoretical Computer Science , ITCS '13 (s. 159-172 ). Association for Computing Machinery. https://doi.org/10.1145/2422436.2422456

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

Brodal, G. S., Fagerberg, R., Pedersen, C. N. S., Östlin, A., Orejas, F. (red.), Spirakis, P. G. (red.) & Leeuwen, J. V. (red.) (2001). The Complexity of Constructing Evolutionary Trees Using Experiments. I Lecture Notes In Computer Science; Vol. 2076: Proceedings of the 28th International Colloquium on Automata, Languages and Programming (2076 of Lecture Notes in Computer Science udg., Bind 2076/2001, s. 140-151). Springer.

Brodal, G. S., Gfeller, B., Jørgensen, A. G. & Sanders, P. (2011). Towards optimal range medians. Theoretical Computer Science, 412(24), 2588-2601. https://doi.org/10.1016/j.tcs.2010.05.003

Brodal, G. S., Davoodi, P. & Rao, S. S. (2012). On Space Efficient Two Dimensional Range Minimum Data Structures. Algorithmica, 63(4), 815-830. https://doi.org/10.1007/s00453-011-9499-0

Brodal, G. S., Greve, M., Pandey, V. & Satti, S. R. (2011). Integer Representations towards Efficient Counting in the Bit Probe Model. Lecture Notes in Computer Science, 6648, 206-217. https://doi.org/10.1007/978-3-642-20877-5_22

Brodal, G. S., Moruz, G. & Negoescu, A. (2012). OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Lecture Notes in Computer Science, 7164, 164-175 . https://doi.org/10.1007/978-3-642-29116-6_14

Brodal, G. S., Sioutas, S., Tsakalidis, K. & Tsichlas, K. (2012). Fully Persistent B-trees. The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 23, 602-614. http://delivery.acm.org.ez.statsbiblioteket.dk:2048/10.1145/2100000/2095167/p602-brodal.pdf?ip=130.225.27.190&acc=ACTIVE%20SERVICE&CFID=163115493&CFTOKEN=91446070&__acm__=1356816735_08b5a98a0788aa0b0163ee8e9fc7dce3

Brodal, G. S., Nielsen, J. A. S. & Truelsen, J. (2012). Finger Search in the Implicit Model. Lecture Notes in Computer Science, 7676, 527-536 . https://doi.org/10.1007/978-3-642-35261-4_55

Brodal, G. S., Fagerberg, R., Mailund, T., Pedersen, C. N. S. & Sand, A. (2013). Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree. The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 24, 1814-1832. http://knowledgecenter.siam.org/0236-000098/0236-000098/1

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

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

Brodal, G. S., Brodnik, A. & Davoodi, P. (2013). The encoding complexity of two dimensional range minimum data structures. I H. L. Bodlaender & G. F. Italiano (red.), Algorithms – ESA 2013: 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings (s. 229-240). Springer VS. https://doi.org/10.1007/978-3-642-40450-4_20

Brodal, G. S. (2013). A Survey on Priority Queues. I A. Brodnik, A. López-Ortiz, V. Raman & A. Viola (red.), Space-Efficient Data Structures, Streams, and Algorithms: Papers in Honor of J. Ian Munro on the Occasion of His 66th Birthday (s. 150-163 ). Springer VS. https://doi.org/10.1007/978-3-642-40273-9_11

Brodal, G. S., Greve, M., Pandy, V. & Satti, S. R. (2014). Integer representations towards efficient counting in the bit probe model. Journal of Discrete Algorithms, 26(May), 34–44. https://doi.org/10.1016/j.jda.2013.11.001

Brodal, G. S., Moruz, G. & Negoescu, A. (2015). OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. Theory of Computing Systems, 56 (1). https://doi.org/10.1007/s00224-012-9427-y

Brodal, G. S., Sioutas, S., Tsichlas, K. & Zaroliagis, C. (2010). D²-tree: A new overlay with deterministic bounds. I O. Cheong , K.-Y. Chwa & K. Park (red.), Algorithms and Computation: 21st International Symposium, ISAAC 2010, Jeju, Korea, December 15-17, 2010, Proceedings, Part II (s. 1-12). Springer VS. https://doi.org/10.1007/978-3-642-17514-5_1

Brodal, G. S., Sioutas, S., Pantazos, K. & Zaroliagis, C. D. (2015). D2-tree: A new overlay with deterministic bounds. Algorithmica, 72(3), 860-883. https://doi.org/10.1007/s00453-014-9878-4

Brodal, G. S., Nielsen, J. A. S. & Truelsen, J. (2015). Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time. I F. Dehne, J.-R. Sack & U. Stege (red.), Algorithms and Data Structures: 14th International Symposium, WADS 2015, Proceedings (s. 91-102). Springer VS. https://doi.org/10.1007/978-3-319-21840-3_8

Brodal, G. S. (2016). External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. I N. Ollinger & H. Vollmer (red.), 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) (Bind 47, s. 23:1-23:14). Artikel 23 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2016.23

Brodal, G. S. & Mampentzidis, K. (2017). Cache oblivious algorithms for computing the triplet distance between trees. I K. Pruhs & C. Sohler (red.), 25th European Symposium on Algorithms, ESA 2017 (Bind 87, s. 21:1--21:14). Artikel 21 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2017.21

Brodal, G. S., Sioutas, S., Tsakalidis, K. & Tsichlas, K. (2020). Fully persistent B-trees. Theoretical Computer Science, 841, 10-26. https://doi.org/10.1016/j.tcs.2020.06.027

Brodal, G. S., Fagerberg, R., Hammer, D., Meyer, U., Penschuck, M. & Tran, H. (2021). An experimental study of external memory algorithms for connected components. I D. Coudert & E. Natale (red.), 19th International Symposium on Experimental Algorithms, SEA 2021 (s. 23). Artikel 23 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SEA.2021.23

Brodal, G. S. (2022). Priority Queues with Decreasing Keys. I P. Fraigniaud & Y. Uno (red.), 11th International Conference on Fun with Algorithms, FUN 2022 (s. 8:1-8:19). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FUN.2022.8

Brodal, G. S., Rysgaard, C. M. & Svenning, R. (2023). External Memory Fully Persistent Search Trees. I B. Saha & R. A. Servedio (red.), STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing (s. 1410-1423). Association for Computing Machinery. https://doi.org/10.1145/3564246.3585140

Brodal, G. S. & Wild, S. (2023). Funnelselect: Cache-Oblivious Multiple Selection. I I. Li Gortz, M. Farach-Colton, S. J. Puglisi & G. Herman (red.), 31st Annual European Symposium on Algorithms, ESA 2023 (s. 25:1-25:17). Artikel 25 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2023.25

Brodal, G. S., Rysgaard, C. M., Schou, J. K. R. & Svenning, R. (2023). Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location. I P. Morin & S. Suri (red.), Algorithms and Data Structures: 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 – August 2, 2023, Proceedings (s. 644-659). Springer. https://doi.org/10.1007/978-3-031-38906-1_43

Brodal, G. S. & Wild, S. (2024). Deterministic Cache-Oblivious Funnelselect. I H. L. Bodlaender (red.), 19th Scandinavian Symposium on Algorithm Theory, SWAT 2024 Artikel 17 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SWAT.2024.17

Brodal, G. S. (2024). Bottom-Up Rebalancing Binary Search Trees by Flipping a Coin. I A. Z. Broder & T. Tamir (red.), 12th International Conference on Fun with Algorithms, FUN 2024 Artikel 6 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FUN.2024.6

Brodal, G. S., Fagerberg, R. & Rysgaard, C. M. (2024). On Finding Longest Palindromic Subsequences Using Longest Common Subsequences. I T. Chan, J. Fischer, J. Iacono & G. Herman (red.), 32nd Annual European Symposium on Algorithms, ESA 2024 Artikel 35 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2024.35

Brodal, G. S. & Rysgaard, C. M. (2025). Pure Binary Finger Search Trees. I I.-O. Bercea & R. Pagh (red.), 8th SIAM Symposium on Simplicity of Algorithms, SOSA 2025 (s. 172-195). Society for Industrial and Applied Mathematics.

Brix, L., Sørensen, T. S., Berber, Y., Ries, M., Stausbøl-Grøn, B. & Ringgaard, S. (2014). Feasibility of interactive magnetic resonance imaging of moving anatomy for clinical practice. Clinical Physiology and Functional Imaging, 34(1), 32-38. https://doi.org/10.1111/cpf.12061

Brix, L., Ringgaard, S., Sandager, P., Petersen, O. B., Sørensen, T. S., Lundorf, E. & Stausbøl-Grøn, B. (2017). Overcoming foetal motion using interactive real-time magnetic resonance imaging. Clinical Physiology and Functional Imaging, 37(6), 717-722. https://doi.org/10.1111/cpf.12364

Britz, D., Østerby, O. & Strutwolf, J. (2012). Minimum grid digital simulation of chronoamperometry at a disk electrode. Electrochimica Acta, 78, 365-376.

Viser resultater 2301 til 2350 ud af 2959

Forrige

Næste

Revideret 09.03.2023

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series