|
Warning: You are viewing outdated content. The current TCS webpage is here.
Bibliography of Theoretical Computer Science, KTH
|
| [1] | Antonis Achilleos, Michael Lampis, and Valia Mitsou. Parameterized modal satisfiability. Algorithmica, 64(1):38-55, 2012. [ bib ] |
| [2] | Afshin Amighi, Pedro de Carvalho Gomes, Dilian Gurov, and Marieke Huisman. Provably correct control-flow graphs from java programs with exceptions. Technical report, KTH, Theoretical Computer Science, TCS, 2012. QC 20120116. [ bib ] |
| [3] | Afshin Amighi, Pedro de Carvalho Gomes, Dilian Gurov, and Marieke Huisman. Sound control-flow graph extraction for Javaf programs with exceptions. In Software Engineering and Formal Methods : 10th International Conference, SEFM 2012, Thessaloniki, Greece, October 1-5, 2012. Proceedings, volume 7504 of Lecture Notes in Computer Science, pages 33-47, 2012. QC 20121213. [ bib ] |
| [4] | Per Austrin and Johan Håstad. On the usefulness of predicates. CoRR, abs/1204.5662, 2012. [ bib ] |
| [5] | Per Austrin and Johan Håstad. On the usefulness of predicates. In IEEE Conference on Computational Complexity (CCC), pages 53-63, 2012. [ bib | DOI | arXiv | www: ] |
| [6] | Per Austrin, Ryan O'Donnell, and John Wright. A New Point of NP-Hardness for 2-to-1 Label Cover. In International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 1-12, 2012. [ bib | DOI | arXiv ] |
| [7] | Per Austrin, Toniann Pitassi, and Yu Wu. Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems. In International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 13-24, 2012. [ bib | DOI | arXiv ] |
| [8] | Musard Balliu, Mads Dam, and Gurvan Le Guernic. Encover: Symbolic exploration for information flow security. In CSF, pages 30-44, 2012. [ bib ] |
| [9] | Amotz Bar-Noy, Panagiotis Cheilaris, Michael Lampis, Valia Mitsou, and Stathis Zachos. Ordered coloring of grids and related graphs. Theor. Comput. Sci., 444:40-51, 2012. [ bib ] |
| [10] | Amotz Bar-Noy and Michael Lampis. Online maximum directed cut. J. Comb. Optim., 24(1):52-64, 2012. [ bib ] |
| [11] | Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, and David Steurer. Making the long code shorter. In FOCS, pages 370-379, 2012. [ bib ] |
| [12] | Olaf Beyersdorff, Nicola Galesi, and Massimo Lauria. A characterization of tree-like resolution size. Electronic Colloquium on Computational Complexity (ECCC), 19:161, 2012. [ bib ] |
| [13] | Olaf Beyersdorff, Nicola Galesi, Massimo Lauria, and Alexander A. Razborov. Parameterized bounded-depth frege is not optimal. TOCT, 4(3):7, 2012. [ bib | DOI ] |
| [14] | Oleksandr Bodriagov and Sonja Buchegger. P2P social networks with broadcast encryption protected privacy. In Jan Camenisch, Bruno Crispo, Simone Fischer-Hübner, Ronald Leenes, and Giovanni Russello, editors, Privacy and Identity Management for Life, volume 375 of IFIP Advances in Information and Communication Technology, pages 197-206. Springer Berlin Heidelberg, 2012. [ bib | DOI | http ] |
| [15] | Alex Borges, Pedro Gomes, José Nacif, Rodrigo Mantini, Jussara M. Almeida, and Sérgio Campos. Characterizing sopcast client behavior. Computer Communications, 35(8):1004 - 1016, 2012. [ bib | DOI | http ] |
| [16] | J. Boye, M. Fredriksson, J. Götze, J. Gustafson, and J. Königsmann. Walk this way: Spatial grounding for city exploration. In IWSDS, 2012. to appear. [ bib ] |
| [17] | Jin-Yi Cai, Sangxia Huang, and Pinyan Lu. From holant to #csp and back: Dichotomy for holant c problems. Algorithmica, 64(3):511-533, 2012. [ bib ] |
| [18] | M. Cheraghchi, J. Håstad, M. Isaksson, and O. Svensson. Approximating linear threshold predicates. ACM Transactins on Computation Theory, 4:1-31, 2012. [ bib | www: ] |
| [19] | N. Crook, D. Field, C. Smith, S. Harding, S. Pulman, M. Cavazza, D. Charlton, R. Moore, and Johan Boye. Generating context-sensitive eca responses to user barge-in interruptions. Journal on Multimodal User Interfaces, 6(1-2):13-25, 2012. QC 20120810. [ bib ] |
| [20] | Mads Dam, Gurvan Le Guernic, and Andreas Lundblad. Treedroid: a tree automaton based approach to enforcing data processing policies. In ACM Conference on Computer and Communications Security, pages 894-905, 2012. [ bib | .pdf ] |
| [21] | Pedro de Carvalho Gomes. Sound modular extraction of control flow graphs from java bytecode, 2012. QC 20121122. [ bib ] |
| [22] | Pedro de Carvalho Gomes and Attilio Picoco. Sound extraction of control-flow graphs from open java bytecode systems. Technical report, KTH, Theoretical Computer Science, TCS, 2012. QC 20121029. [ bib ] |
| [23] | Mateus De Oliveira Oliveira. Canonizable partial order generators. In Language and Automata Theory and Applications, volume 7183 of Lecture Notes in Computer Science, pages 445-457, 2012. QC 20120802. [ bib ] |
| [24] | Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, and Neil Thapen. Space complexity in polynomial calculus. Electronic Colloquium on Computational Complexity (ECCC), 19:132, 2012. [ bib ] |
| [25] | Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, and Noga Ron-Zewi. Space complexity in polynomial calculus. In IEEE Conference on Computational Complexity, pages 334-344, 2012. [ bib | DOI ] |
| [26] | Pedro Gomes, Sergio Campos, and Alex Borges. Verification of P2P live streaming systems using symmetry-based semiautomatic abstractions. In 3rd International Workshop on Modeling and Simulation of Peer-to-Peer Architectures and Systems (MOSPAS), June 2012. Accepted. To be published. [ bib ] |
| [27] | Benjamin Greschbach and Sonja Buchegger. Datenschutz in dezentralisierten sozialen netzwerken. In D-A-CH Security, 2012. [ bib ] |
| [28] | Benjamin Greschbach and Sonja Buchegger. Friendly surveillance - a new adversary model for privacy in decentralized online social networks. In Fifth interdisciplinary Conference on Current Issues in IT Security 2012, May 08-10, 2012, Freiburg, Germany, Proceedings, pages 195-206. Duncker & Humblot, Berlin, 2012. [ bib | .pdf ] |
| [29] | Benjamin Greschbach, Gunnar Kreitz, and Sonja Buchegger. The devil is in the metadata - new privacy challenges in decentralised online social networks. In Tenth Annual IEEE International Conference on Pervasive Computing and Communications, PerCom 2012, March 19-23, 2012, Lugano, Switzerland, Workshop Proceedings, pages 333-339. IEEE, 2012. [ bib | DOI | .pdf ] |
| [30] | Dilian Gurov, Bjarte Østvold, and Ina Schaefer. A hierarchical variability model for software product lines. In Post-proceedings of: ISoLa 2011, volume 336, pages 181-199, 2012. [ bib | .pdf ] |
| [31] | Johan Håstad. On the correlation of parity and small-depth circuits. Electronic Colloquium on Computational Complexity (ECCC), 19:137, 2012. [ bib ] |
| [32] | Johan Håstad. On the NP-hardness of Max-Not-2. In APPROX-RANDOM, pages 170-181, 2012. [ bib ] |
| [33] | Sangxia Huang. Approximation resistance on satisfiable instances for predicates strictly dominating parity. Electronic Colloquium on Computational Complexity (ECCC), 19:40, 2012. [ bib ] |
| [34] | Sangxia Huang and Pinyan Lu. A dichotomy for real weighted holant problems. In IEEE Conference on Computational Complexity, pages 96-106, 2012. [ bib ] |
| [35] | Trinh Huynh and Jakob Nordström. On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity. In STOC, pages 233-248, 2012. [ bib ] |
| [36] | S. Janarthanam, O. Lemon, X. Liu, P. Bartie, W. Mackaness, T. Dalmas, and J. Götze. Conversational natural language interaction for place-related knowledge acquisition. In Place-related Knowledge Acquisition Research Workshop (PKAR), Spatial Cognition Conference, pages 33-38, 2012. [ bib ] |
| [37] | S. Janarthanam, O. Lemon, X. Liu, P. Bartie, W. Mackaness, T. Dalmas, and J. Götze. Integrating location, visibility, and question-answering in a spoken dialogue system for pedestrian city exploration. In SIGDIAL, pages 314-316, 2012. [ bib ] |
| [38] | S. Janarthanam, O. Lemon, X. Liu, P. Bartie, W. Mackaness, T. Dalmas, and J. Götze. Integrating location, visibility, and question-answering in a spoken dialogue system for pedestrian city exploration. In SEMDIAL, pages 157-158, 2012. [ bib ] |
| [39] | Matti Järvisalo, Arie Matsliah, Jakob Nordström, and Stanislav Zivny. Relating proof complexity measures and practical hardness of sat. In CP, pages 316-331, 2012. [ bib ] |
| [40] | Kristján Valur Jónsson, Karl Palmskog, and Ymir Vigfússon. Secure distributed top-k aggregation. In Proceedings of IEEE International Conference on Communications (ICC), June 2012. [ bib ] |
| [41] | V. Kann. Lärosalsgruppen fixar salarna åt lärarna! In Proc. NU2012, Chalmers, Göteborg, 2012. [ bib ] |
| [42] | Shahram Khazaei, Björn Terelius, and Douglas Wikström. Cryptanalysis of a universally verifiable efficient re-encryption mixnet. IACR Cryptology ePrint Archive, 2012:100, 2012. [ bib ] |
| [43] | Shahram Khazaei and Douglas Wikström. Randomized partial checking revisited. IACR Cryptology ePrint Archive, 2012:63, 2012. [ bib ] |
| [44] | D. Komm, R. Kr€™a;loviÄŤ, and Tobias Mömke. On the advice complexity of the set cover problem. In Computer Science - Theory and Applications, volume 7353 of Lecture Notes in Computer Science, pages 241-252, 2012. QC 20121018. [ bib ] |
| [45] | Gunnar Kreitz, Oleksandr Bodriagov, Benjamin Greschbach, Guillermo Rodríguez-Cano, and Sonja Buchegger. Passwords in peer-to-peer. In P2P, pages 167-178, 2012. [ bib ] |
| [46] | Gunnar Kreitz, Mads Dam, and Douglas Wikström. Practical private information aggregation in large networks. In Information Security Technology For Applications, number 7127 in Lecture Notes in Computer Science, pages 89-103, 2012. QC 20110420. [ bib ] |
| [47] | Supriya Krishnamurthy and Sumedha. On the behaviour of random k -sat on trees. Journal of Statistical Mechanics: Theory and Experiment, 2012(05):P05009, 2012. [ bib | http ] |
| [48] | Michael Lampis. Algorithmic meta-theorems for restrictions of treewidth. Algorithmica, 64(1):19-37, 2012. [ bib ] |
| [49] | Michael Lampis. Improved inapproximability for TSP. In APPROX-RANDOM, pages 243-253, 2012. [ bib ] |
| [50] | Michael Lampis. Improved inapproximability for TSP. CoRR, abs/1206.2497, 2012. [ bib ] |
| [51] | Michael Lampis. Local improvement gives better expanders. CoRR, abs/1211.0524, 2012. [ bib ] |
| [52] | Michael Lampis, Valia Mitsou, and Karolina Soltys. Scrabble is pspace-complete. CoRR, abs/1201.5298, 2012. [ bib ] |
| [53] | Massimo Lauria. A rank lower bound for cutting planes proofs of ramsey theorem. Electronic Colloquium on Computational Complexity (ECCC), 19:124, 2012. [ bib ] |
| [54] | K. Meinke and F. Niu. An incremental learning algorithm for extended mealy automata. In Proc. 5th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation, number 7609 in LNCS, pages 488-504. Springer, 2012. [ bib ] |
| [55] | K. Meinke, F. Niu, and M. Sindhu. Learning-based software testing: a tutorial. In Leveraging Applications of Formal Methods, Verification, and Validation, number 336 in CCIS, pages 200-219. Springer, 2012. [ bib ] |
| [56] | K. Meinke and N. Walkinshaw. Model-based testing and model inference. In Proc. 5th International Symposium On Leveraging Applications of Formal Methods, Verification and Validation, number 7609 in LNCS, pages 440-443. Springer, 2012. [ bib ] |
| [57] | Michael Minock, Johan Boye, Stephen Clark, Hector Geffner Morgan Fredriksson, Oliver Lemon, William Mackaness, and Bonnie Webber. Initial description of results and plans for dissemination. Technical Report D7.2.1, SpaceBook project report, December 2012. [ bib ] |
| [58] | Michael Minock, Johan Mollevik, and Mattias Åsander. Toward an active database platform for guiding urban pedestrians. Technical Report 12.18, Umeå University Department of Computing Science, October 2012. [ bib ] |
| [59] | Jakob Nordström. On the relative strength of pebbling and resolution. ACM Trans. Comput. Log., 13(2):16, 2012. [ bib ] |
| [60] | Thomas Paul, Benjamin Greschbach, Sonja Buchegger, and Thorsten Strufe. Exploring decentralization dimensions of social networking services: adversaries and availability. In Proceedings of the First ACM International Workshop on Hot Topics on Interdisciplinary Social Networks Research, HotSocial '12, pages 49-56, New York, NY, USA, 2012. ACM. [ bib | DOI ] |
| [61] | Krzysztof Pietrzak and Douglas Wikström. Parallel repetition of computationally sound protocols revisited. J. Cryptology, 25(1):116-135, 2012. [ bib ] |
| [62] | Lukas Polacek and Ola Svensson. Quasi-polynomial local search for restricted max-min fair allocation. In Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I, ICALP'12, pages 726-737, Berlin, Heidelberg, 2012. Springer-Verlag. [ bib | DOI | http ] |
| [63] | K. Rechert and Benjamin Greschbach. Location privacy in relation to trusted peers. In Security and Trust Management, volume 7170 of Lecture Notes in Computer Science, pages 106-121, 2012. QC 20120806. [ bib ] |
| [64] | Oliver Schwarz and Christian Gehrmann. Securing DMA through virtualization. In COMPENG, pages 1-6, 2012. [ bib ] |
| [65] | Siavash Soleimanifard. Procedure-modular verification of temporal safety properties, 2012. QC 20120507. [ bib ] |
| [66] | Björn Terelius and Douglas Wikström. Efficiency limitations of sigma-protocols for group homomorphisms revisited. In SCN, pages 461-476, 2012. [ bib ] |
| [67] | Cenny Wenner. Circumventing d-to-1 for approximation resistance of satisfiable predicates strictly containing parity of width at least four. Electronic Colloquium on Computational Complexity (ECCC), 19:145, 2012. [ bib ] |
| [68] | Cenny Wenner. Circumventing d-to-1 for approximation resistance of satisfiable predicates strictly containing parity of width four (extended abstract). In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, number 7408 LNCS in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pages 325-337. Springer-Verlag, 2012. QC 20121114. [ bib ] |
| [69] | Rerngvit Yanggratoke, Gunnar Kreitz, Mikael Goldmann, and Rolf Stadler. Predicting response times for the spotify backend. In CNSM, pages 117-125, 2012. [ bib ] |
This file was generated by bibtex2html 1.96.