Aarhus Universitets segl

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

Orlandi, C. (2011). Secure Computation in Untrusted Environments. Department of Computer Science, Aarhus University.
Toft, T. (2011). Secure data structures based on multi-party computation. I Proceedings of the 30th Annual ACM SIGACT-SIGOPS ACM Symposium on Principles of Distributed Computing, PODC 2011 (s. 291-292). Association for Computing Machinery. https://doi.org/10.1145/1993806.1993859
Choudhury, A., Patra, A., Ashwinkumar, B. V., Srinathan, K. & Pandu Rangan, C. (2011). Secure message transmission in asynchronous networks. Journal of Parallel and Distributed Computing, 71(8), 1067-1074. https://doi.org/10.1016/j.jpdc.2011.03.004
Hansen, K. A., Koucky, M., Lauritzen, N. & Tsigaridas, E. (2011). Separation bounds for real roots of polynomial systems. Afhandling præsenteret på MEGA 2011: Effective Methods in Algebraic Geometry, Stockholm, Sverige.
Gjerlufsen, T., Klokmose, C. N., Eagan, J., Pillias, C. & Beaudouin-Lafon, M. (2011). Shared Substance: Developing Flexible Multi-Surface Applications. I D. S. Ten, S. Amershi, B. Begole, W. A. Kellogg & M. Tungare (red.), Proceedings of the International Conference on Human Factors in Computing Systems, CHI 2011 (s. 3383-3392). Association for Computing Machinery. https://doi.org/10.1145/1978942.1979446
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
Daskalakis, C., Karp, R. M., Mossel, E., Riesenfeld, S. & Verbin, E. (2011). Sorting and selection in posets. S I A M Journal on Computing, 40(3), 597-622. https://doi.org/10.1137/070697720
Lu, H., Yang, B. & Jensen, C. S. (2011). Spatio-temporal joins on symbolic indoor tracking data. Proceedings of the International Conference on Data Engineering, 816-827. https://doi.org/10.1109/ICDE.2011.5767902
Dalsgaard, B., Magård, E., Fjeldså, J., Martín González, A. M., Rahbek, C., Olesen, J. M., Ollerton, J., Alarcón, R., Cardoso Araujo, A., A. Cotton, P., Lara, C., Graco Machado, C., Sazima, I., Sazima, M., Timmermann, A., Watts, S., Sandel, B. S., J. Sutherland, W. & Svenning, J.-C. (2011). Specialization in Plant-Hummingbird Networks Is Associated with Species Richness, Contemporary Precipitation and Quaternary Climate-Change Velocity. PLoS One, 6(10). https://doi.org/10.1371/journal.pone.0025891
Hoggan, E., Trendafilov, D., Ahmaniemi, T. & Raisamo, R. (2011). Squeeze vs. tilt: a comparative study using continuous tactile feedback. I CHI'11 Extended Abstracts on Human Factors in Computing Systems (s. 1309-1314)
Micenkova, B. & van Beusekom, J. (2011). Stamp Detection in Color Document Images. I 2011 International Conference on Document Analysis and Recognition (ICDAR) (s. 1125-1129). IEEE Computer Society Press. https://doi.org/10.1109/ICDAR.2011.227
Hansen, T. D., Miltersen, P. B. & Zwick, U. (2011). Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. I Proceedings of the Second Symposium on Innovations in Computer Science (s. 253-263). Tsinghua University Press, Beijing. http://conference.itcs.tsinghua.edu.cn/ICS2011/content/papers/7.html
Friedmann, O., Hansen, T. D. & Zwick, U. (2011). Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. I Proceedings of the 43rd annual ACM symposium on Theory of computing (s. 283-292). Association for Computing Machinery. https://doi.org/10.1145/1993636.1993675
Noe, K. Ø., Tanderup, K. & Sørensen, T. S. (2011). Surface membrane based bladder registration for evaluation of accumulated dose during brachytherapy in cervical cancer. I Proceedings of the 2011 IEEE International Symposium on Biomedical Imaging: From Nano to Macro (s. 1253-1256). IEEE Signal Processing Society. https://doi.org/10.1109/ISBI.2011.5872629
Faust, S., Pietrzak, K. & Venturi, D. (2011). Tamper-Proof Circuits : : How to Trade Leakage for Tamper-Resilience. Lecture Notes in Computer Science, 6755, 391-402 . https://doi.org/10.1007/978-3-642-22006-7_33
Petersen, M. G. & Rasmussen, M. K. (2011). The Ambiguity of Shape Changing Interfaces. Afhandling præsenteret på Organic User Interface Workshop, Funchal, Portugal.
Kranen, P., Assent, I., Baldauf, C. & Seidl, T. (2011). The ClusTree : indexing micro-clusters for anytime stream mining. Knowledge and Information Systems, 29(2), 249-272. https://doi.org/10.1007/s10115-010-0342-8
Bender, M. A., Brodal, G. S., Fagerberg, R., Ge, D., He, S., Hu, H., Iacono, J. & López-Ortiz, A. (2011). The Cost of Cache-Oblivious Searching. Algorithmica, 61(2), 463-505. https://doi.org/10.1007/s00453-010-9394-0
Fogtmann, M. H. & Kinch, S. (2011). The design researcher in quandary: the conflicting roles of being both a designer and a design researcher. I Procedings of the Second Conference on Creativity and Innovation in Design (s. 193-196)
Schulz, H.-J., Hadlak, S. & Schumann, H. (2011). The Design Space of Implicit Hierarchy Visualization: A Survey. IEEE Transactions on Visualization and Computer Graphics, 17(4), 393-411. https://doi.org/10.1109/TVCG.2010.79
Kaaresoja, T., Anttila, E. & Hoggan, E. (2011). The effect of tactile feedback latency in touchscreen interaction. I World Haptics Conference (WHC), 2011 IEEE (s. 65-70)
Verbin, E. & Yu, W. (2011). The Streaming Complexity of Cycle Counting, Sorting by Reversals, and Other Problems. I Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 2011 (s. 11-25). Society for Industrial and Applied Mathematics. http://www.siam.org/proceedings/soda/2011/SODA11_002_verbine.pdf
Corry, A. V. & Søndergaard, B. D. (2011). The Teaching Portfolio. Developing Good Teachers and Scientists, 1.
Sidlauskas, D., Ross, K. A., Jensen, C. S. & Saltenis, S. (2011). Thread-Level Parallel Indexing of Update Intensive Moving-Object Workloads. Lecture Notes in Computer Science, 6849, 186-204. https://doi.org/10.1007/978-3-642-22922-0_12
Gál, A., Hansen, K. A., Koucký, M., Pudlák, P. & Viola, E. (2011). Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electronic Colloquium on Computational Complexity, 18(150). http://eccc.hpi-web.de/report/2011/150/
Hansen, M. T. & Kusy, B. (2011). TinyInventor: A Holistic Approach to Sensor Network Application Development. Afhandling præsenteret på Extending the Internet to Low power and Lossy Networks. IP+SN 2011 , Chicago, IL, USA.
Feldthaus, A., Millstein, T., Møller, A., Schäfer, M. & Tip, F. (2011). Tool-supported Refactoring for JavaScript. I Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications (s. 119-138). Association for Computing Machinery. https://doi.org/10.1145/2048066.2048078
Asharov, G., Canetti, R. & Hazay, C. (2011). Towards a Game Theoretic View of Secure Computation. Lecture Notes in Computer Science, 426-445. https://doi.org/10.1007/978-3-642-20465-4_24
Christensen, H. B. & Hansen, K. M. (2011). Towards Architectural Information in Implementation. I R. Taylor, H. Gall & N. Medvidocvic (red.), Proceedings of 33rd International Conference on Software Engineering: ICSE 2011 (s. 928-931). Association for Computing Machinery. https://doi.org/10.1145/1985793.1985948
Hansen, K. M., Ingstrup, M., Kyng, M. & Olsen, J. W. (2011). Towards a Software Ecosystem of Healthcare Services. I Proceedings of the 3rd International Workshop on Infrastructures for Healthcare: Global Healthcare (s. 27-30) http://www.itu.dk/people/lrc/ProcInfraHealth2011.PDF
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