Aarhus University Seal

Publications

Search for publications at Department of Computer Science

Below you find a complete list of publications published and edited by scientists at the Department of Computer Science

Sort by: Date | Author | Title

Scheder, D. & Tan, L. Y. (2013). On the average sensitivity and density of k-CNF formulas. In P. Prasad , S. Raskhodnikova, K. Jansen & J. D. P. Rolim (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings (pp. 683-698). Springer VS. https://doi.org/10.1007/978-3-642-40328-6_47
Nielsen, J. B., Venturi, D. & Zottarel, A. (2013). On the Connection between Leakage Tolerance and Adaptive Security. In K. Kurosawa & G. Hanaoka (Eds.), Public-Key Cryptography – PKC 2013: 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26 – March 1, 2013. Proceedings (pp. 497-515 ). Springer VS. https://doi.org/10.1007/978-3-642-36362-7_30
Ishai, Y., Kushilevitz, E., Meldgaard, S. T., Orlandi, C. & Paskin-Cherniavsky, A. (2013). On the Power of Correlated Randomness in Secure Computation. In A. Sahai (Ed.), Theory of Cryptography: 10th TCC 2013. Proceedings (pp. 600-620 ). Springer VS. https://doi.org/10.1007/978-3-642-36594-2_34
Dang, X.-H., Micenková, B., Assent, I. & Ng, R. T. (2013). Outlier Detection with Space Transformation and Spectral Analysis. In C. Kamath, J. Dy, Z. Obradovic, J. Ghosh, S. Parthasarathy & Z.-H. Zhou (Eds.), Proceedings of the 2013 SIAM International Conference on Data Mining, SDM (pp. 225-233). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611972832.25
Faust, S., Hazay, C. & Venturi, D. (2013). Outsourced pattern matching. In F. V. Fomin (Ed.), Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II (pp. 545-556). Springer VS. https://doi.org/10.1007/978-3-642-39212-2_48
Anderson, J. W. J., Haas, P. A., Mathieson, L.-A., Volynkin, V., Lyngsø, R., Tataru, P. & Hein, J. (2013). Oxfold: Kinetic Folding of RNA using Stochastic Context-Free Grammars and Evolutionary Information. Bioinformatics, 29(6), 704-710. https://doi.org/10.1093/bioinformatics/btt050
Magnani, M. & Rossi, L. (2013). Pareto distance for multi-layer network analysis. In A. M. Greenberg, W. G. Kennedy & N. D. Bos (Eds.), Social Computing, Behavioral-Cultural Modeling and Prediction: 6th International Conference, SBP 2013, Washington, DC, USA, April 2-5, 2013. Proceedings (pp. 249-256). Springer VS. https://doi.org/10.1007/978-3-642-37210-0_27
Hansen, K. A. & Podolskii, V. V. (2013). Polynomial threshold functions and Boolean threshold circuits. Electronic Colloquium on Computational Complexity, (TR13-021). http://eccc.hpi-web.de/report/2013/021/
Hansen, K. A. & Podolskii, V. V. (2013). Polynomial threshold functions and Boolean threshold circuits. In K. Chatterjee & J. Sgall (Eds.), Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (pp. 516-527 ). Springer VS. https://doi.org/10.1007/978-3-642-40313-2_46
Damgård, I. B., Keller, M., Larraia , E., Pastro, V., Scholl, P. & Smart, N. P. (2013). Practical Covertly Secure MPC for Dishonest Majority – or: Breaking the SPDZ Limits. In J. Crampton , S. Jajodia & K. Mayes (Eds.), Computer Security – ESORICS 2013: 18th European Symposium on Research in Computer Security, Egham, UK, September 9-13, 2013. Proceedings (pp. 1-18 ). Springer VS. https://doi.org/10.1007/978-3-642-40203-6_1
Madsen, M., Livshits, B. & Fanning, M. (2013). Practical static analysis of JavaScript applications in the presence of frameworks and libraries. In B. Meyer, L. Baresi & M. Mezini (Eds.), Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering , ESEC/FSE 2013 (pp. 499-509). Association for Computing Machinery. https://doi.org/10.1145/2491411.2491417
Erkin, Z., Veugen, T., Toft, T. & Lagendijk, R. L. (2013). Privacy-preserving distributed clustering. Eurasip Journal on Information Security, 1, Article 4. https://doi.org/10.1186/1687-417X-2013-4
Puech, M. (2013). Proofs, Upside Down. In Programming Languages and Systems: 11th Asian Symposium, APLAS 2013, Melbourne, VIC, Australia, December 9-11, 2013. Proceedings (pp. 365-380 ). Springer VS. https://doi.org/10.1007/978-3-319-03542-0_26
Korsgaard, H. & Brynskov, M. (2013). Prototyping a Smart City. Paper presented at International Workshop Digital Cities, Munich, Germany.
Bogdanov, A., Dvir, Z., Verbin, E. & Yehudayoff, A. (2013). Pseudorandomness for width-2 branching programs. Theory of Computing, 9(7), 283-293. https://doi.org/10.4086/toc.2013.v009a007
Zottarel, A. (2013). Public key cryptography from weaker assumptions. Institut for Datalogi, Aarhus Universitet.
Jensen, C. S. (2013). Querying the Web with Local Intent. Abstract from International Conference on Mobile Data Management, Milan, Italy. https://doi.org/10.1109/MDM.2013.101
Arge, L. & Thorup, M. (2013). RAM-Efficient External Memory Sorting. In L. Cai, S.-W. Cheng & T.-W. Lam (Eds.), Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (pp. 491-501 ). Springer VS. https://doi.org/10.1007/978-3-642-45030-3_46
Dagdelen, Ö., Mohassel, P. & Venturi, D. (2013). Rate-limited secure function evaluation: Definitions and constructions. In K. Kurosawa & G. Hanaoka (Eds.), Public-Key Cryptography – PKC 2013: 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26 – March 1, 2013. Proceedings (Vol. 7778 LNCS, pp. 461-478). Springer VS. https://doi.org/10.1007/978-3-642-36362-7_28
Miltersen, P. B. (2013). Recent results on howard's algorithm. In A. Kučera (Ed.), Mathematical and Engineering Methods in Computer Science: 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers (pp. 53-56). Springer VS. https://doi.org/10.1007/978-3-642-36046-6_6
Brucato, M., Derczynski, L., Llorens, H., Bontcheva, K. & Jensen, C. S. (2013). Recognising and Interpreting Named Temporal Expressions. In G. Angelova, K. Bontcheva & R. Mitkov (Eds.), Proceedings of Recent Advances in Natural Language Processing (pp. 113-122). INCOMA Ltd. http://lml.bas.bg/ranlp2013/history.php
Thomsen, J. G., Clausen, C., Andersen, K. J., Danaher, J. & Ernst, E. (2013). Reducing Lookups for Invariant Checking. In G. Castagna (Ed.), ECOOP 2013 – Object-Oriented Programming : 27th European Conference, Montpellier, France, July 1-5, 2013. Proceedings (pp. 426-450). Springer VS. https://doi.org/10.1007/978-3-642-39038-8_18
Moon, B., Jun, J. Y., Lee, J., Kim, K., Hachisuka, T. & Yoon , S. E. (2013). Robust Image Denoising using a Virtual Flash Image for Monte Carlo Ray Tracing. Computer Graphics Forum, 32(1), 139–151. https://doi.org/10.1111/cgf.12004
Ceikute, V. & Jensen, C. S. (2013). Routing Service Quality—Local Driver Behavior Versus Routing Services. In IEEE 14th International Conference on Mobile Data Management (MDM), 2013 (Volume:1 ) (pp. 97 - 106 ). IEEE. https://doi.org/10.1109/MDM.2013.20
Lipmaa, H. & Toft, T. (2013). Secure equality and greater-than tests with sublinear online complexity. In F. V. Fomin , R. Freivalds, M. Kwiatkowska & D. Peleg (Eds.), Automata, Languages, and Programming: Proceedings, 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Part II (pp. 645-656). Springer Publishing Company. https://doi.org/10.1007/978-3-642-39212-2_56
Feldthaus, A. & Møller, A. (2013). Semi-Automatic Rename Refactoring for JavaScript. ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages and Applications, 323-338 . https://doi.org/10.1145/2509136.2509520
Jensen, C. S., Møller, A. & Su, Z. (2013). Server Interface Descriptions for Automated Testing of JavaScript Web Applications. In B. Meyer, L. Baresi & M. Mezini (Eds.), Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering, ESEC/FSE 2013 (pp. 510-520 ). Association for Computing Machinery. https://doi.org/10.1145/2491411.2491421
Xu, Y., Johnson, P. M., Moore, C. A., Brewer, R. S. & Takayama, J. (2013). SGSEAM: Assessing serious game frameworks from a stakeholder experience perspective. In Gamification 2013: Proceedings of the First International Conference on Gameful Design, Research, and Applications Enterprice Gamification Consultancy. http://csdl.ics.hawaii.edu/techreports/2013/13-03/13-03.pdf
Magnani, M., Assent, I., Hornbæk, K., Jakobsen, M. R. & Larsen, K. F. (2013). SkyView: a user evaluation of the skyline operator. In Q. He & A. Iyengar (Eds.), Proceedings of the 22nd ACM International Conference on Information & Knowledge Management, CIKM '13 (pp. 2249-2254 ). Association for Computing Machinery. https://doi.org/10.1145/2505515.2505739
Brody, J. E., Chen, S., Papakonstantinou , P. A., Song, H. & Sun, X. (2013). Space-bounded communication complexity. In Proceedings of the 4th conference on Innovations in Theoretical Computer Science , ITCS '13 (pp. 159-172 ). Association for Computing Machinery. https://doi.org/10.1145/2422436.2422456
Cozza, V., Messina, A., Montesi, D., Arietta, L. & Magnani, M. (2013). Spatio-temporal keyword queries in social networks. In B. Catania, G. Guerrini & J. Pokorný (Eds.), Advances in Databases and Information Systems: 17th East European Conference, ADBIS 2013, Genoa, Italy, September 1-4, 2013. Proceedings (pp. 70-83). Springer Publishing Company. https://doi.org/10.1007/978-3-642-40683-6_6
Hachisuka, T., Jarosz, W., Georgiev, I., Kaplanyan, A., Nowrouzezahrai, D. & Spencer, B. (2013). State of the Art in Photon-Density Estimation: Course notes. In Proceeding, SA '13 SIGGRAPH Asia 2013 Courses Association for Computing Machinery. https://doi.org/10.1145/2542266.2542281
Jensen, S. H. (2013). Static Analysis for JavaScript. Datalogisk Institut, Aarhus Universitet.
Birkedal, L., Bizjak, A. & Schwinghamme, J. (2013). Step-Indexed Relational Reasoning for Countable Nondeterminism. Logical Methods in Computer Science, 9(4), Article 4. https://doi.org/10.2168/LMCS-9(4:4)2013