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

Jensen, C. S. (Ed.), Jermaine, C., Zhou, X. (Ed.), Kotagiri, R. (Ed.) & Ooi, B. C. (Ed.) (2013). Message from the ICDE 2013 Program Committee and General. In 2013 IEEE 29th International Conference on Data Engineering (ICDE), : Australia, April 8–11, 2013 (pp. i-ii). IEEE Communications Society. http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6530811

Hu, H. (Ed.), Jensen, C. S. & Dingming , D. (Ed.) (2013). Message from the LBS n.0 Workshop Organizers. In IEEE 14th International Conference on Mobile Data Management (MDM), 2013 (Volume:2 ) (pp. xiii). IEEE. http://mdm2013.dico.unimi.it/

Wölfel, C. & Merritt, T. (2013). Method card design dimensions: A survey of card-based design tools. In P. Kotzé et al. (Ed.), Human-Computer Interaction – INTERACT 2013: 14th IFIP TC 13 International Conference, Cape Town, South Africa, September 2-6, 2013, Proceedings, Part I (pp. 479-486). Springer VS. https://doi.org/10.1007/978-3-642-40483-2_34

Kristensen, T. G., Nielsen, J. & Pedersen, C. N. S. (2013). Methods for Similarity-Based Virtual Screening. Computational and Structural Biotechnology Journal, 5(6). https://doi.org/10.5936/csbj.201302009

Frederiksen, T. K., Jakobsen, T. P., Nielsen, J. B., Nordholt, P. S. & Orlandi, C. (2013). MiniLEGO: Efficient secure two-party computation from general assumptions. In T. Johansson & P. Q. Nguyen (Eds.), Advances in Cryptology – EUROCRYPT 2013: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings (pp. 537-556). Springer VS. https://doi.org/10.1007/978-3-642-38348-9_32

Larsen, K. G. (2013). Models and Techniques for Proving Data Structure Lower Bounds. Department of Computer Science, Aarhus University.

Liu, K., Yang, B., Shang, S., Li, Y. & Ding, Z. (2013). MOIR/UOTS: Trip recommendation with user oriented trajectory search. In IEEE 14th International Conference on Mobile Data Management (MDM), 2013 (Volume:1 ) (pp. 335-337). IEEE. https://doi.org/10.1109/MDM.2013.49

Sergey, I., Devriese, D., Might, M., Midtgaard, J., Darais, D., Clarke, D. & Piessens, F. (2013). Monadic abstract interpreters. In H.-J. Boehm (Ed.), Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI '13 (pp. 399-410). Association for Computing Machinery. https://doi.org/10.1145/2491956.2491979

Frederiksen, S. K. S. & Miltersen, P. B. (2013). Monomial strategies for concurrent reachability games and other stochastic games. In P. A. Abdulla & I. Potapov (Eds.), Reachability Problems: 7th International Workshop, RP 2013, Uppsala, Sweden, September 24-26, 2013 Proceedings (pp. 122-134 ). Springer VS. https://doi.org/10.1007/978-3-642-41036-9_12

Alamdari, S., Angelini, P., Chan, T. M., Di Battista, G., Frati, F., Lubiw, A., Patrignani, M., Roselli, V., Singla, S. & Wilkinson, B. T. (2013). Morphing Planar Graph Drawings with a Polynomial Number of Steps. The Annual A C M - S I A M Symposium on Discrete Algorithms. Proceedings, 24, 1656-1667. http://knowledgecenter.siam.org/0236-000137/0236-000137/1

Wu, D., Yiu, M. L. & Jensen, C. S. (2013). Moving Spatial Keyword Queries: Formulation, Methods, and Analysis. A C M Transactions on Database Systems, 38(1), Article 7. https://doi.org/10.1145/2445583.2445590

Andersen, M. S. (2013). Multi-dimensional Location Privacy: Concepts, Architecture, and User Interface. Datalogisk Institut, Aarhus Universitet.

Arge, L., Walderveen, F. V. & Zeh, N. (2013). Multiway simple cycle separators and I/O-efficient algorithms for planar graphs. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 901-918). Society for Industrial and Applied Mathematics. http://knowledgecenter.siam.org/soda/

Larsen, K. G. & Walderveen, F. V. (2013). Near-Optimal Range Reporting Structures for Categorical. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 (pp. 265-276). Association for Computing Machinery. http://knowledgecenter.siam.org/0236-000081/~~PdfSource/0

Nordholt, P. S. (2013). New Approaches to Practical Secure Two-Party Computation. Institut for Datalogi, Aarhus Universitet.

Olsen, M. & Revsbæk, M. (2013). On Alliance Partitions and Bisection Width for Planar Graphs. Journal of Graph Algorithms and Applications, 17(6), 599-614. https://doi.org/10.7155/jgaa.00307

Arge, L., Fischer, J., Sanders, P. & Sitchinava, N. (2013). On (dynamic) range minimum queries in external memory. In F. Dehne, R. Solis-Oba & J.-R. Sack (Eds.), Algorithms and Data Structures: 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings (pp. 37-48). Springer VS. https://doi.org/10.1007/978-3-642-40104-6_4

Zerny, I. (2013). On Graph Rewriting, Reduction, and Evaluation in the Presence of Cycles. Higher-Order and Symbolic Computation, 26(1), 63–84. https://doi.org/10.1007/s10990-014-9103-9

Blunck, H., Bouvin, N. O., Franke, T., Grønbæk, K., Kjærgaard, M. B., Lukowicz, P. & Wüstenberg, M. (2013). On Heterogeneity in Mobile Sensing Applications Aiming at Representative Data Collection. In F. Mattern & S. Santini (Eds.), Proceedings of the 2013 ACM Conference on Pervasive and Ubiquitous Computing Adjunct Publication, UbiComp '13 Adjunct (pp. 1087-1098 ). Association for Computing Machinery. https://doi.org/10.1145/2494091.2499576

Lam, T.-W., Lee, L. K., To, I. K. K. & Wong, P. W. H. (2013). Online Speed Scaling Based on Active Job Count to Minimize Flow Plus Energy. Algorithmica, 65(3), 605-633 . https://doi.org/10.1007/s00453-012-9613-y

Grönvall, E. & Kyng, M. (2013). On participatory design of home-based healthcare. Cognition, Technology and Work, 15(4), 389-401. https://doi.org/10.1007/s10111-012-0226-7

Müller-Lennert, M., Dupont-Dupuis, F., Szehr, O., Fehr, S. & Tomamichel, M. (2013). On quantum Rényi entropies: A new generalization and some properties. Journal of Mathematical Physics, 54(12), Article 122203. https://doi.org/10.1063/1.4838856

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

Jeronimo, G., Perrucci, D. & Tsigaridas, E. (2013). On the minimum of a polynomial function on a basic closed semialgebraic set and applications. S I A M Journal on Optimization, 23(1), 241-255. https://doi.org/10.1137/110857751

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

Yi, K. & Zhang, Q. (2013). Optimal Tracking of Distributed Heavy Hitters and Quantiles. Algorithmica, 65(1), 206-223 . https://doi.org/10.1007/s00453-011-9584-4

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

Bødker, S. & Zander, P.-O. M. (2013). Participation, civic engagement and Web 2.0 – three cases. Abstract from Rethinking participatory cultural citizenship, Aarhus, Denmark. http://conferences.au.dk/fileadmin/conferences/rethinkcitizenship/SessionsWithAbstracts_13.pdf

Hansen, K. A., Ibsen-Jensen, R., Podolskii, V. V. & Tsigaridas, E. (2013). Patience of matrix games. Discrete Applied Mathematics, 161(16-17), 2440–2459. http://www.sciencedirect.com.ez.statsbiblioteket.dk:2048/science/article/pii/S0166218X13002357

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

Pierce, J., Strengers, Y., Sengers, P. & Bødker, S. (Eds.) (2013). Practice-oriented approaches to Sustainable HCI: A Special Issue of ACM Transactions on Computer-Human Interaction (ACM TOCHI). ACM Transactions on Computer-Human Interaction, 20(4). http://dl.acm.org/citation.cfm?id=2509404&picked=prox&cfid=249995314&cftoken=45766466

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

Ernst, E. (Ed.) (2013). Proceedings of the 12th workshop on Foundations of aspect-oriented languages. Association for Computing Machinery.

Fritsch, J., Dalsgaard, P., Hansen, N. B. & Petersen, M. G. (Eds.) (2013). Proceedings of the 2013 Student Interaction Design Research conference (SIDeR 2013).

Jensen, C. S., Jermaine, C. & Zhou, X. (Eds.) (2013). Proceedings of the 29th IEEE International Conference on Data Engineering, (ICDE). IEEE. http://ieeexplore.ieee.org.ez.statsbiblioteket.dk:2048/xpl/mostRecentIssue.jsp?punumber=6530811

Assent, I., Domeniconi, C., Gullo, F., Tagarelli, A. & Zimek, A. (Eds.) (2013). Proceedings of the 4th MultiClust Workshop on Multiple Clusterings, Multi-view Data, and Multi-source Knowledge-driven Clustering. Association for Computing Machinery. http://dl.acm.org.ez.statsbiblioteket.dk:2048/citation.cfm?id=2501006&coll=DL&dl=ACM

Mackay, W. E., Brewster, S. & Bødker, S. (Eds.) (2013). Proceedings of the SIGCHI Conference on Human Factors in Computing Systems: ACM SIGCHI Conference, Paris, France — April 27 - May 02, 2013. Association for Computing Machinery. http://dl.acm.org/citation.cfm?id=2470654

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

Afshani, P., Matulef, K. & Wilkinson, B. T. (2013). Property Testing on Linked Lists. Electronic Colloquium on Computational Complexity, TR13-187. http://www.informatik.uni-trier.de/~ley/db/journals/eccc/eccc20.html

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

Displaying results 2401 to 2450 out of 5737

Revised 17.04.2023

Marianne Dammand Iversen

Publications

Search for publications at Department of Computer Science

Search for publications at Aarhus University