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

Charbit, P., Couteau, G., Meyer, P. E. & Naserasr, R. (2024). A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. 167–199. Abstract fra Theory of Cryptography, Milan, Italien. https://eprint.iacr.org/2024/1473

Chandran, N., Goyal, V., Mukherjee, P., Pandey, O. & Upadhyay, J. (2015). Block-wise Non-Malleable Codes. Cryptology ePrint Archive. http://eprint.iacr.org/2015/129

Chan, H.-L., Lam, T.-W., Lee, L. K., Pan, J., Ting, H.-F. & Zhang, Q. (2011). Edit Distance to Monotonicity in Sliding Windows. Lecture Notes in Computer Science, 7074, 564-573. https://doi.org/10.1007/978-3-642-25591-5_58

Chan, S.-H., Lam, T.-W., Lee, L. K., Liu, C.-M. & Ting, H.-F. (2011). Sleep Management on Multiple Machines for Energy and Flow Time. Lecture Notes in Computer Science, 6755, 219-231. https://doi.org/10.1007/978-3-642-22006-7_19

Chan, T. M., Durocher, S., Larsen, K. G., Morrison, J. & Wilkinson, B. T. (2012). Linear-Space Data Structures for Range Mode Query in Arrays. Leibniz International Proceedings in Informatics, 14, 290-301. https://doi.org/10.4230/LIPIcs.STACS.2012.290

Chan, H.-L., Lam, T.-W., Lee, L. K. & Ting, H.-F. (2012). Continuous monitoring of distributed data streams over a time-based sliding window. Algorithmica, 62(3-4), 1088-1111 . https://doi.org/10.1007/s00453-011-9506-5

Chan, H.-L., Chan, S.-H., Lam, T.-W., Lee, L. K. & Zhu, J. (2012). Non-clairvoyant weighted flow time scheduling with rejection penalty. I Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (s. 246-254 ). Association for Computing Machinery. https://doi.org/10.1145/2312005.2312050

Chan, T. M., Durocher, S., Larsen, K. G., Morrison, J. & Wilkinson, B. T. (2014). Linear-Space Data Structures for Range Mode Query in Arrays. Theory of Computing Systems, 55(4), 719-741. https://doi.org/10.1007/s00224-013-9455-2

Chan, T. M. & Wilkinson, B. T. (2013). Adaptive and Approximate Orthogonal Range Counting. I S. Khanna (red.), Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 (s. 241-251). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973105.18

Chan, T. M., Durocher, S., Skala, M. & Wilkinson, B. T. (2015). Linear-Space Data Structures for Range Minority Query in Arrays. Algorithmica, 72(4), 901-913. https://doi.org/10.1007/s00453-014-9881-9

Chan, T. M. & Wilkinson, B. T. (2016). Adaptive and approximate orthogonal range counting. ACM Transactions on Algorithms, 12(4), 45:1-45:15. Artikel 45. https://doi.org/10.1145/2830567

Chan, T. M., Cheng, P. & Zheng, D. W. (2024). Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane. I W. Mulzer & J. M. Phillips (red.), 40th International Symposium on Computational Geometry, SoCG 2024 Artikel 33 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.SoCG.2024.33

Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N. & Vaidya, K. (2017). Data-Centric Dynamic Partial Order Reduction. Proc. ACM Program. Lang., 2(POPL). https://doi.org/10.1145/3158119

Chakravarty, M. (red.), Hu, Z. (red.) & Danvy, O. (2011). Proceedings of the 16th ACM SIGPLAN international conference on Functional programming. Association for Computing Machinery. http://dl.acm.org/citation.cfm?id=2034773&coll=DL&dl=ACM&CFID=108524911&CFTOKEN=41587659

Chakraborty, S., Ganesh, C., Pancholi, M. R. & Sarkar, P. (2021). Reverse Firewalls for Adaptively Secure MPC without Setup. I M. Tibouchi & H. Wang (red.), Advances in Cryptology – ASIACRYPT 2021 - 27th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings, Part 2: 27th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 6–10, 2021, Proceedings, Part II (s. 335-364). Springer. https://doi.org/10.1007/978-3-030-92075-3_12

Chakraborty, S., Dziembowski, S. & Nielsen, J. B. (2020). Reverse firewalls for actively secure mpcs. I D. Micciancio & T. Ristenpart (red.), Advances in Cryptology - CRYPTO 2020 (s. 732-762). Springer. https://doi.org/10.1007/978-3-030-56880-1_26

Chakraborty, S., Magri, B., Nielsen, J. B. & Venturi, D. (2022). Universally Composable Subversion-Resilient Cryptography. I O. Dunkelman & S. Dziembowski (red.), Advances in Cryptology – EUROCRYPT 2022: 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, Proceedings (s. 272-302). Springer. https://doi.org/10.1007/978-3-031-06944-4_10

Chakraborty, S., Kayal, C. & Paraashar, M. (2022). Separations Between Combinatorial Measures for Transitive Functions. I M. Bojanczyk, E. Merelli & D. P. Woodruff (red.), 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022 Artikel 36 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2022.36

Chakraborty, S., Kayal, C., Mittal, R., Paraashar, M., Sanyal, S. & Saurabh, N. (2023). On the Composition of Randomized Query Complexity and Approximate Degree. I N. Megow & A. Smith (red.), Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, APPROX/RANDOM 2023 Artikel 63 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.63

Chakraborty, S., Krishna, S. N., Mathur, U. & Pavlogiannis, A. (2024). How Hard Is Weak-Memory Testing? Proceedings of the ACM on Programming Languages , 8, Artikel 66. https://doi.org/10.1145/3632908

Chakraborty, M., Gnanakumar, A., Sridharan, M. & Møller, A. (2024). Indirection-Bounded Call Graph Analysis. I J. Aldrich & G. Salvaneschi (red.), 38th European Conference on Object-Oriented Programming, ECOOP 2024 Artikel 3 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ECOOP.2024.10

Č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

Cermak, J., Bosansky, B. & Gatti, N. (2015). Strategy Effectiveness of Game-Theoretical Solution Concepts in Extensive-Form General-Sum Games. Abstract fra International Conference on Autonomous Agents and Multiagent Systems, Istanbul, Tyrkiet. http://dl.acm.org/citation.cfm?id=2773450&CFID=719158965&CFTOKEN=25615646

Ceikute, V. & Jensen, C. S. (2013). Vehicle Routing With User Generated Trajectory Data. http://www.sciencegate.ch/. http://nelanth.cvt.dk/cgi-bin/das-oai/ddf

Ceikute, V. (2013). Inferring Groups of Objects, Preferred Routes, and Facility Locations from Trajectories. Department of Computer Science, Aarhus University.

Ceikute, V. & Jensen, C. S. (2013). Routing Service Quality—Local Driver Behavior Versus Routing Services. I IEEE 14th International Conference on Mobile Data Management (MDM), 2013 (Volume:1 ) (s. 97 - 106 ). IEEE. https://doi.org/10.1109/MDM.2013.20

Cavassim, M. I. A. (2020). Recombination and horizontal gene transfer through the lens of phylogenomics. Århus Universitet.

Caspersen, M. E., Iversen, O. S., Nielsen, M., Hjorth, H. A. & Musaeus, L. H. (2018). Computational Thinking — hvorfor, hvad og hvordan? Efter opdrag fra Villum Fondens bestyrelse.

Cascudo Pueyo, I., Damgård, I. B. & Ranellucci, S. (2014). Server-Aided Two-Party Computation with Simultaneous Corruption. (s. 18). Cryptology ePrint Archive. Report / Cryptology ePrint Archive Nr. 2014/809 http://eprint.iacr.org/2014/809.pdf

Cascudo Pueyo, I., Cramer, R., Mirandola, D. & Zémor, G. (2015). Squares of Random Linear Codes. I E E E Transactions on Information Theory, 61(3), 1159-1173. https://doi.org/10.1109/TIT.2015.2393251

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

Cascudo Pueyo, I., Cramer, R., Mirandola, D., Padró, C. & Xing, C. (2015). On Secret Sharing with Nonlinear Product Reconstruction. S I A M Journal on Discrete Mathematics, 29(2), 1114-1131. https://doi.org/10.1137/130931886

Cascudo Pueyo, I. (2015). Powers of codes and applications to cryptography: (Invited Paper). I IEEE Information Theory Workshop (ITW), 2015 IEEE. https://doi.org/10.1109/ITW.2015.7133155

Cascudo, I., Damgård, I., Lacerda, F. & Ranellucci, S. (2016). Oblivious transfer from any non-trivial elastic noisy channel via secret key agreement. I Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings (Bind 9985, s. 204-234). Springer VS. https://doi.org/10.1007/978-3-662-53641-4_9

Cascudo, I., Damgård, I., David, B. M., Döttling, N. & Nielsen, J. B. (2016). Rate-1, linear time and additively homomorphic UC commitments. I M. Robshaw & J. Katz (red.), Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings (Bind 9816, s. 179-207). Springer VS. https://doi.org/10.1007/978-3-662-53015-3_7

Cascudo, I., Damgård, I., Farràs, O. & Ranellucci, S. (2017). Resource-Efficient OT Combiners with Active Security. I Y. Kalai & L. Reyzin (red.), Theory of Cryptography - 15th International Conference, TCC 2017, Proceedings (Bind 10678, s. 461-486). Springer VS. https://doi.org/10.1007/978-3-319-70503-3_15

Cascudo, I., Damgård, I., David, B., Döttling, N., Dowsley, R. & Giacomelli, I. (2019). Efficient UC Commitment Extension with Homomorphism for Free (and Applications). I S. D. Galbraith & S. Moriai (red.), Advances in Cryptology – ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (s. 606-635). Springer. https://doi.org/10.1007/978-3-030-34621-8_22

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

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

Caragiannis, I., Filos-Ratsikas, A., Kanellopoulos, P. & Vaish, R. (2021). Stable Fractional Matchings. Artificial Intelligence, 295, Artikel 103416. https://doi.org/10.1016/j.artint.2020.103416

Caragiannis, I. & Fanelli, A. (2021). On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. Journal of Computer and System Sciences, 117, 40-48. https://doi.org/10.1016/j.jcss.2020.10.007

Caragiannis, I., Kanellopoulos, P. & Kyropoulou, M. (2021). On Interim Envy-Free Allocation Lotteries. I Proceedings of the 22nd ACM Conference on Economics and Computation (EC 2021) (s. 264-284). Association for Computing Machinery. https://doi.org/10.1145/3465456.3467648

Caragiannis, I. & Hansen, K. A. (red.) (2021). Algorithmic Game Theory: 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021, Proceedings. Springer. Lecture Notes in Computer Science https://doi.org/10.1007/978-3-030-85947-3

Caragiannis, I., Kaklamanis, C., Karanikolas, N. & Krimpas, G. (2022). Evaluating approval-based multiwinner voting in terms of robustness to noise. Autonomous Agents and Multi-Agent Systems, 36(1), Artikel 1. https://doi.org/10.1007/s10458-021-09530-w

Caragiannis, I., Kanellopoulos, P. & Voudouris, A. A. (2022). Bounding the Inefficiency of Compromise in Opinion Formation. Algorithmica, 84(1), 234-271. https://doi.org/10.1007/s00453-021-00892-x

Caragiannis, I., Gravin, N., Lu, P. & Wang, Z. (2022). Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. I M. Feldman, H. Fu & I. Talgam-Cohen (red.), Web and Internet Economics : 17th International Conference, WINE 2021 (s. 131-148). Springer. https://doi.org/10.1007/978-3-030-94676-0_8

Caragiannis, I. & Ioannidis, S. D. (2022). Computing Envy-Freeable Allocations with Limited Subsidies. I M. Feldman, H. Fu & I. Talgam-Cohen (red.), Web and Internet Economics : 17th International Conference, WINE 2022 (s. 522-539). Springer. https://doi.org/10.1007/978-3-030-94676-0_29

Caragiannis, I., Christodoulou, G. & Protopapas, N. (2022). Impartial Selection with Additive Approximation Guarantees. Theory of Computing Systems, 66(3), 721-742. https://doi.org/10.1007/s00224-022-10081-0

Caragiannis, I., Shah, N. & Voudouris, A. A. (2022). The metric distortion of multiwinner voting. Artificial Intelligence, 313, Artikel 103802. https://doi.org/10.1016/j.artint.2022.103802

Caragiannis, I., Micha, E. & Shah, N. (2022). A Little Charity Guarantees Fair Connected Graph Partitioning. I AAAI-22 Technical Tracks 5 (Bind 11, s. 4908-4916). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20420

Viser resultater 2201 til 2250 ud af 2959

Forrige

Næste

Revideret 09.03.2023

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series