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

Chondrogiannis, T., Bouros, P., Gamper, J. & Leser, U. (2017). Exact and Approximate Algorithms for Finding k-Shortest Paths with Limited Overlap. 414-425. Afhandling præsenteret på International Conference on Extending Database Technology, Venice, Italien. https://doi.org/10.5441/002/edbt.2017.37

Chillotti, I., Orsini, E., Scholl, P., Smart, N. P. & Leeuwen, B. V. (2022). Scooby: Improved Multi-party Homomorphic Secret Sharing Based on FHE. I C. Galdi & S. Jarecki (red.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (s. 540-563). Springer. https://doi.org/10.1007/978-3-031-14791-3_24

Chiang, J. H. Y., David, B., Eyal, I. & Gong, T. (2023). FairPoS: Input Fairness in Permissionless Consensus. I J. Bonneau & S. M. Weinberg (red.), 5th Conference on Advances in Financial Technologies, AFT 2023 Artikel 10 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AFT.2023.10

Chiang, J. H. Y., David, B., Gama, M. & Lebeda, C. J. (2023). Correlated-Output Differential Privacy and Applications to Dark Pools. I J. Bonneau & S. M. Weinberg (red.), 5th Conference on Advances in Financial Technologies, AFT 2023 Artikel 11 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AFT.2023.11

Cheung, V., Watson, D., Vermeulen, J., Hancock, M. & Scott, S. (2014). Overcoming Interaction Barriers in Large Public Displays Using Personal Devices. -, 375-380. https://doi.org/10.1145/2669485.2669549

Chester, S., Mortensen, M. L. & Assent, I. (2014). On the Suitability of Skyline Queries for Data Exploration. I K. S. Candan et al. (red.), Proceedings of the Workshops of the EDBT/ICDT 2014 Joint Conference: 1st International Workshop on Exploratory Search in Databases and the Web (ExploreDB 2014) (s. 161-166). CEUR-WS.org. http://ceur-ws.org/Vol-1133/paper-27.pdf

Chester, S., Sidlauskas, D., Assent, I. & Bøgh, K. S. (2015). Scalable Parallelization of Skyline Computation for Multi-core Processors. I 31st IEEE International Conference on Data Engineering (ICDE 2015) (s. 1083 - 1094). IEEE Computer Society Press. https://doi.org/10.1109/ICDE.2015.7113358

Chester, S. & Assent, I. (2015). Explanations for Skyline Query Results. I International Conference on Extending Database Technology (EDBT 2015) (s. 349-360). openproceedings.org. https://doi.org/10.5441/002/edbt.2015.31

Cherabini, L. & Danvy, O. (2011). A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration. Journal of Formalized Reasoning, 4(1), 85-109. http://jfr.cib.unibo.it/article/view/2225

Cheng, J. Y. & Mailund, T. (2020). Ancestral population genomics with Jocx, a coalescent hidden markov model. I J. Y. Dutheil (red.), Statistical population genomics (s. 167-189). Humana Press. https://doi.org/10.1007/978-1-0716-0199-0_8

Cheng, P. & Afshani, P. (2023). An Optimal Lower Bound for Simplex Range Reporting. I T. Kavitha & K. Mehlhorn (red.), 6th Symposium on Simplicity in Algorithms (SOSA 2023) (s. 272-277). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977585.ch25

Cheng, Y. W., Zhong, Z., Pang, J. & Li, C. T. (2024). Hierarchical Bipartite Graph Convolutional Network for Recommendation. IEEE Computational Intelligence Magazine, 19(2), 49-60. https://doi.org/10.1109/MCI.2024.3363973

Cheng, P. (2023). On Geometric Range Searching and Its Variants. Århus Universitet.

Chen, S., Verbin, E. & Yu, W. (2012). Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings. http://arxiv.org/abs/1203.1080

Chen, S., Scheder, D. A., Talebanfard, N. & Tang, B. (2013). Exponential Lower Bounds for the PPSZ k-SAT Algorithm. I Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '13 (s. 1253-1263). Society for Industrial and Applied Mathematics. http://knowledgecenter.siam.org/0236-000027/0236-000027/1

Chen, N., Deng, X., Zhang, H. & Zhang, J. (2012). Incentive Ratios of Fisher Markets. Lecture Notes in Computer Science, 7392, 464-475 . https://doi.org/10.1007/978-3-642-31585-5_42

Chen, L., Jensen, C. S. & Wu, D. (2013). Spatial Keyword Query Processing: An Experimental Evaluation. Proceedings of the VLDB Endowment, 6(3), 217-228. http://www.vldb.org/pvldb/vol6/p217-chen.pdf

Chen, D., Konrad, C., Yi, K., Yu, W. & Zhang, Q. (2014). Robust set reconciliation. I Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD '14 (s. 135-146). Association for Computing Machinery. https://doi.org/10.1145/2588555.2610528

Chen, P. P., Wang, Z. Y., Yu, S. W., Hong, J. M., Poulsen, P. R., Ji, Y. L., Miao, B. Y., Han, M. & Wang, G. H. (1998). Self-organization of Te clusters in nanofilm by low energy beam deposition. Physics Letters, Section A: General, Atomic and Solid State Physics, 244(5), 407-412. https://doi.org/10.1016/S0375-9601(98)00346-6

Chen, N., Chen, X., Zhong, Z. & Pang, J. (2024). Bridging Performance of X (formerly known as Twitter) Users: A Predictor of Subjective Well-Being During the Pandemic. ACM Transactions on the Web, 18(1), Artikel 15. https://doi.org/10.1145/3635033

Chen, N., Chen, X., Zhong, Z. & Pang, J. (2025). "Double vaccinated, 5G boosted!": Learning Attitudes towards COVID-19 Vaccination from Social Media. ACM Transactions on the Web, 19(1), Artikel 8. https://doi.org/10.1145/3702654

Chechik, S., Hansen, T. D., Italiano, G. F., Łącki, J. & Parotsidis, N. (2016). Decremental Single-Source Reachability and Strongly Connected Components in Õ(m√n) Total Update Time. I Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016 (s. 315-324). Artikel 7782945 IEEE. https://doi.org/10.1109/FOCS.2016.42

Chechik, S., Hansen, T. D., Italiano, G. F., Loitzenbauer, V. & Parotsidis, N. (2017). Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs. I 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (s. 1900-1918). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611974782.124

Chaugule, P., Kumar, M., Limaye, N., Mohapatra, C. K., She, A. & Srinivasan, S. (2023). Schur Polynomials Do Not Have Small Formulas If the Determinant does not. Computational Complexity, 32(1), Artikel 3. https://doi.org/10.1007/s00037-023-00236-x

Chatzopoulos, S., Vergoulis, T., Skoutas, D., Dalamagas, T., Tryfonopoulos, C. & Karras, P. (2023). Atrapos: Real-time Evaluation of Metapath Query Workloads. I ACM Web Conference 2023 - Proceedings of the World Wide Web Conference, WWW 2023 (s. 2487-2498). Association for Computing Machinery. https://doi.org/10.1145/3543507.3583322

Chatzigiannakis, I., Michail, O., Nikolaou, S., Pavlogiannis, A. & Spirakis, P. G. (2011). Passively mobile communicating machines that use restricted space. Theoretical Computer Science, 412(46), 6469-6483. https://doi.org/10.1016/j.tcs.2011.07.001

Chattopadhyay, A., Gavaldà, R., Hansen, K. A. & Thérien, D. (2014). Learning Read-Constant Polynomials of Constant Degree Modulo Composites. Theory of Computing Systems, 55(2), 404-420. https://doi.org/10.1007/s00224-013-9488-6

Chatterjee, K., Hansen, K. A. & Ibsen-Jensen, R. (2017). Strategy Complexity of Concurrent Safety Games. I K. G. Larsen, H. L. Bodlaender & J.-F. Raskin (red.), 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) (Bind 83, s. 55:1-55:13). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2017.55

Chatterjee, K., Pavlogiannis, A., Adlam, B. & Nowak, M. A. (2014). The Time Scale of Evolutionary Innovation. PLoS Computational Biology, Edited by Niko Beerenwinkel, 10(9). https://doi.org/10.1371/journal.pcbi.1003818

Chatterjee, K., Goharshady, A. K., Goyal, P., Ibsen-Jensen, R. & Pavlogiannis, A. (2019). Faster algorithms for dynamic algebraicqueries in basic RSMs with constant treewidth. ACM Transactions on Programming Languages and Systems, 41(4), Artikel 23. https://doi.org/10.1145/3363525

Chatterjee, K., Goharshady, A. K., Ibsen-Jensen, R. & Pavlogiannis, A. (2020). Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis. I P. Müller (red.), Programming Languages and Systems- 29th European Symposium on Programming, ESOP 2020 held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Proceedings (s. 112-140). Springer. https://doi.org/10.1007/978-3-030-44914-8_5

Chatterjee, K., Ibsen-Jensen, R. & Pavlogiannis, A. (2021). Faster algorithms for quantitative verification in bounded treewidth graphs. Formal Methods in System Design, 57(3), 401-428. https://doi.org/10.1007/s10703-021-00373-5

Chatterjee, K., Ibsen-Jensen, R. & Pavlogiannis, A. (2021). Quantitative Verification on Product Graphs of Small Treewidth. I 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021) (Bind ´, s. 42:1-42:23). Artikel 42 https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42

Chatterjee, K., Svoboda, J., Žikelić, Đ., Pavlogiannis, A. & Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. Physical Review E, 106(3), Artikel 034321. https://doi.org/10.1103/PhysRevE.106.034321

Chatterjee, K., Ibsen-Jensen, R. R. & Pavlogiannis, A. (2016). Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. I 24th Annual European Symposium on Algorithms (ESA 2016) (s. 28:1-28:17). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2016.28

Chase, M., Derler, D., Goldfeder, S., Orlandi, C., Ramacher, S., Rechberger, C., Slamanig, D. & Zaverucha, G. (2017). Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives. I CCS 2017 - Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (s. 1825-1842). Association for Computing Machinery. https://doi.org/10.1145/3133956.3133997

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

Viser resultater 2201 til 2250 ud af 3004

Forrige

Næste

Revideret 09.03.2023

Marianne Dammand Iversen

Publikationer

Søg publikationer fra Institut for Datalogi

DAIMI Report series