Items where Subject is "000 Computer science, knowledge & general works > 000 Computer science, knowledge & systems > 004 Data processing & computer science"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Authors | Item Type
Jump to: A | B | C | D | E | F | G | H | J | K | M | N | R | T | W | Č
Number of items at this level: 77.

A

Alwen, Joël and Krenn, Stephan and Pietrzak, Krzysztof and Wichs, Daniel (2013) Learning with rounding, revisited: New reduction properties and applications. In: CRYPTO: International Cryptology Conference, Ausgust 18-22, 2013, Santa Barbara, CA, USA.

Avni, Guy and Guha, Shibashis and Kupferman, Orna (2017) Timed Network Games. In: MFCS: Mathematical Foundations of Computer Science, August 21- August 25, 2017, Aalborg, Denmark.

Avni, Guy and Guha, Shibashis and Kupferman, Orna (2017) An abstraction-refinement methodology for reasoning about network games. In: IJCAI: International Joint Conference on Artificial Intelligence, August 19 - 25, 2017, Melbourne, Australia.

Avni, Guy and Henzinger, Thomas A and Chonev, Ventsislav (2017) Infinite-Duration Bidding Games. In: CONCUR: International Conference on Concurrency Theory, September 5-7, 2017, Berlin, Germany.

B

Banerjee, Abishek and Fuchsbauer, Georg and Peikert, Chris and Pietrzak, Krzysztof and Stevens, Sophie (2015) Key-homomorphic constrained pseudorandom functions. In: TCC: Theory of Cryptography Conference, March 23 - 25, 2015, Warsaw, Poland.

Benhamouda, Fabrice and Krenn, Stephan and Lyubashevsky, Vadim and Pietrzak, Krzysztof (2015) Efficient zero-knowledge proofs for commitments from learning with errors over rings. In: ESORICS: European Symposium on Research in Computer Security, September 21 - 25, 2015, Vienna, Austria.

Berwanger, Dietmar and Chatterjee, Krishnendu and De Wulf, Martin and Doyen, Laurent and Henzinger, Thomas A (2009) Alpaga: A tool for solving parity games with imperfect information. In: TACAS: Tools and Algorithms for the Construction and Analysis of Systems, March 22-29, 2009, York, UK.

Beyer, Dirk and Henzinger, Thomas A and Théoduloz, Grégory and Zufferey, Damien (2010) Shape refinement through explicit heap analysis. In: FASE: Fundamental Approaches to Software Engineering, March 20-28, 2010, Paphos, Cyprus.

Bloem, Roderick and Chatterjee, Krishnendu and Greimel, Karin and Henzinger, Thomas A and Jobstmann, Barbara (2010) Robustness in the presence of liveness. In: CAV: Computer Aided Verification, July 15-19, 2010, Edinburgh, UK.

Bojsen-Hansen, Morten (2016) Tracking, Correcting and Absorbing Water Surface Waves. PhD thesis, IST Austria.

Boker, Udi and Chatterjee, Krishnendu and Henzinger, Thomas A and Kupferman, Orna (2014) Temporal Specifications with Accumulative Values. ACM Transactions on Computational Logic (TOCL), 15 (4). Article No. 27.

Boker, Udi and Chatterjee, Krishnendu and Henzinger, Thomas A and Kupferman, Orna (2011) Temporal specifications with accumulative values. Technical Report. IST Austria.

Boker, Udi and Henzinger, Thomas A (2012) Approximate determinization of quantitative automata. In: FSTTCS: Foundations of Software Technology and Theoretical Computer Science, December 15-18, 2012, Hyderabad, India.

Boker, Udi and Henzinger, Thomas A (2011) Determinizing discounted-sum automata. In: CSL: Computer Science Logic.

Boker, Udi and Henzinger, Thomas A and Otop, Jan (2015) The Target Discounted-Sum Problem. Technical Report. IST Austria.

Brázdil, Tomáš and Chatterjee, Krishnendu and Forejt, Vojtěch and Kučera, Antonín (2017) Trading performance for stability in Markov decision processes. Journal of Computer and System Sciences, 84. pp. 144-1170. ISSN 1090-2724

Brázdil, Tomáš and Forejt, Vojtěch and Kučera, Antonín and Novotný, Petr (2016) Stability in graphs and games. In: CONCUR: Concurrency Theory, August 23-26, 2016, Québec City, Canada.

C

Chatterjee, Krishnendu and Doyen, Laurent and Gimbert, Hugo and Henzinger, Thomas A (2010) Randomness for free. In: MFCS: Mathematical Foundations of Computer Science, August 23-27, 2010, Brno, Czech Republic.

Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A (2009) Alternating weighted automata. In: FCT: Fundamentals of Computation Theory, September 2-4, 2009, Wroclaw, Poland.

Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A (2010) Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science, 6 (3). Article Nr. 3. ISSN 1860-5974

Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A (2010) Qualitative analysis of partially-observable Markov Decision Processes. In: MFCS: Mathematical Foundations of Computer Science , August 23-27, 2010, Brno, Czech Republic.

Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A (2010) Quantitative languages. ACM Transactions on Computational Logic (TOCL), 11. ISSN 1557-945X

Chatterjee, Krishnendu and Dvorák, Wolfgang and Henzinger, Monika and Loitzenbauer, Veronika (2016) Conditionally optimal algorithms for generalized Büchi Games. In: MFCS: International Symposium on Mathematical Foundations of Computer Science , August 22-26, 2016, Krakow, POL.

Chatterjee, Krishnendu and Henzinger, Monika (2011) An O(n2) time algorithm for alternating Büchi games. Technical Report. IST Austria.

Chatterjee, Krishnendu and Henzinger, Thomas A and Horn, Florian (2009) Finitary winning in omega-regular games. ACM Transactions on Computational Logic (TOCL), 11. ISSN 1557-945X

Chatterjee, Krishnendu and Henzinger, Thomas A and Horn, Florian (2009) Improved lower bounds for request-response and finitary Streett games. Technical Report. IST Austria.

Chatterjee, Krishnendu and Henzinger, Thomas A and Ibsen-Jensen, Rasmus and Otop, Jan (2015) Edit Distance for Pushdown Automata. Technical Report. IST Austria.

Chatterjee, Krishnendu and Henzinger, Thomas A and Jobstmann, Barbara and Radhakrishna, Arjun (2010) GIST: A solver for probabilistic games. In: CAV: Computer Aided Verification, July 15-19, 2010, Edinburgh, UK.

Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan (2015) Nested Weighted Automata. Technical Report. IST Austria.

Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan (2016) Nested weighted limit-average automata of bounded width. In: MFCS: Mathematical Foundations of Computer Science, August 22-26, 2016, Krakow, Poland.

Chatterjee, Krishnendu and Henzinger, Thomas A and Otop, Jan and Velner, Yaron (2014) Quantitative Fair Simulation Gamest. Technical Report. IST Austria.

Chatterjee, Krishnendu and Henzinger, Thomas A and Piterman, Nir (2010) Strategy logic. Information and Computation, 208. ISSN 0890-5401

Chatterjee, Krishnendu and Henzinger, Thomas A and Tracol, Mathieu (2012) The decidability frontier for probabilistic automata on infinite words. Technical Report. IST Austria.

Chatterjee, Krishnendu and Ibsen-Jensen, Rasmus and Pavlogiannis, Andreas (2016) Optimal reachability and a space time tradeoff for distance queries in constant treewidth graphs. In: ESA: European Symposium on Algorithms , August 22-26, 2016, Aarhus, DK.

Chatterjee, Krishnendu and Komarkova, Zuzana and Kretinsky, Jan (2015) Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. Technical Report. IST Austria.

Chonev, Ventsislav and Ouaknine, Joël and Worrell, James (2016) On the skolem problem for continuous linear dynamical systems. In: ICALP: International Colloquium on Automata, Languages, and Programming , July 11-15, 2016, Rome, IT.

D

Daca, Przemyslaw (2017) Statistical and logical methods for property checking. PhD thesis, IST Austria.

Daca, Przemyslaw and Henzinger, Thomas A and Kretinsky, Jan and Petrov, Tatjana (2016) Linear distances between Markov chains. In: CONCUR: Concurrency Theory, August 23-26, 2016, Quebec City, Canada.

Delahaye, Benoît and Fahrenberg, Uli and Henzinger, Thomas A and Legay, Axel and Ničković, Dejan (2012) Synchronous interface theories and time triggered scheduling. In: FORTE: Formal Techniques for Networked and Distributed Systems & FMOODS: Formal Methods for Open Object-Based Distributed Systems , June 13-16, 2012, Stockholm, Sweden.

Didier, Frédéric and Henzinger, Thomas A and Mateescu, Maria and Wolf, Verena (2011) Approximation of event probabilities in noisy cellular processes. Theoretical Computer Science, 412. ISSN 0304-3975

Didier, Frédéric and Henzinger, Thomas A and Mateescu, Maria and Wolf, Verena (2010) SABRE: A tool for the stochastic analysis of biochemical reaction networks. In: QEST: Quantitative Evaluation of Systems, September 15-18, 2010, Williamsburg, VA, USA.

Dodis, Yevgeniy and Pietrzak, Krzysztof and Kiltz, Eike and Wichs, Daniel (2012) Message authentication, revisited. In: EUROCRYPT: International Conference on the Theory and Applications of Cryptographic Techniques, April 15-19, 2012, Cambridge, United Kingdom.

Dodis, Yevgeniy and Pietrzak, Krzysztof and Wichs, Daniel (2014) Key derivation without entropy waste. In: EUROCRYPT: Theory and Applications of Cryptographic Techniques, April 11-15, 2014, Copenhagen, Denmark.

Doyen, Laurent and Henzinger, Thomas A and Legay, Axel and Ničković, Dejan (2010) Robustness of sequential circuits. In: ACSD: Application of Concurrency to System Design, June 21-25, 2010, Braga, Portugal.

Dragoi, Cezara and Enea, Constantin and Sighireanu, Mihaela (2013) Local Shape Analysis for Overlaid Data Structures. Static Analysis - 20th International Symposium, SAS 2013, Seattle, WA, USA, June 20-22, 2013., 7935. pp. 150-171. ISSN 978-3-642-38855-2

Dragoi, Cezara and Gupta, Ashutosh and Henzinger, Thomas A (2013) Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013., 8044. pp. 174-190. ISSN 978-3-642-39798-1

E

Edelsbrunner, Herbert and Pausinger, Florian (2016) Approximation and convergence of the intrinsic volume. Advances in Mathematics, 287. pp. 674-703. ISSN 1090-2082

F

Fuchsbauer, Georg and Jafargholi, Zahra and Pietrzak, Krzysztof (2015) A quasipolynomial reduction for generalized selective decryption on trees. In: CRYPTO: Annual Cryptology Conference, August 16 - 20, 2015, Santa Barbara, CA, USA.

G

Ga, Peter and Pietrzak, Krzysztof and Rybar, Michal (2014) The exact PRF-security of NMAC and HMAC. In: CRYPTO: International Cryptology Conference, August 17-21, 2014, Santa Barbara, CA, USA.

Gaži, Peter and Pietrzak, Krzysztof and Tessaro, Stefano (2015) Generic security of NMAC and HMAC with input whitening. In: ASIACRYPT: Theory and Application of Cryptology and Information Security, November 29 - December 3, 2015, Auckland, New Zealand.

Gaži, Peter and Pietrzak, Krzysztof and Tessaro, Stefano (2015) The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC. In: CRYPTO: International Cryptology Conference, August 16-20, 2015, Santa Barbara, CA, USA.

H

Haas, Andreas and Henzinger, Thomas A and Holzer, Andreas and Kirsch, Christoph M and Lippautz, Michael and Payer, Hannes and Sezgin, Ali and Sokolova, Ana and Veith, Helmut (2016) Local linearizability for concurrent container-type data structures. In: CONCUR: Concurrency Theory, August 23-26, 2016, Quebec City, Canada.

Halalai, Raluca and Henzinger, Thomas A and Singh, Vasu (2011) Quantitative evaluation of BFT protocols. In: QEST: Quantitative Evaluation of Systems, 5-8 Sept. 2011 , Aachen.

Held, Martin and Huber, Stefan G and Palfrader, Peter (2016) Generalized offsetting of planar structures using skeletons. Computer-Aided Design and Applications, 13 (5). pp. 712-721. ISSN 1686-4360

Henzinger, Thomas A and Kirsch, Christoph M and Payer, Hannes and Sezgin, Ali and Sokolova, Ana (2013) Quantitative relaxation of concurrent data structures. In: POPL: Principles of Programming Languages., January 23 - 25, 2013 , Rome, Italy.

Henzinger, Thomas A and Mateescu, Maria (2011) Propagation models for computing biochemical reaction networks. In: CMSB: Conference on Computational Methods in Systems Biology, September 21 - 23, 2011 , Paris, France.

Henzinger, Thomas A and Mateescu, Maria and Mikeev, Linar and Wolf, Verena (2010) Hybrid numerical solution of the chemical master equation. In: CMSB: Computational Methods in Systems Biology, September 29 - October 1, 2010, Trento, Italy.

Henzinger, Thomas A and Otop, Jan (2013) From Model Checking to Model Measuring. In: CONCUR 2013 – Concurrency Theory. Lecture Notes in Computer Science, 8052 (8052). Springer, Berlin Heidelberg, pp. 273-287. ISBN 978-3-642-40184-8

Henzinger, Thomas A and Otop, Jan and Samanta, Roopsha (2014) Lipschitz robustness of finite-state transducers. In: FSTTCS:Foundation of Software Technology and Theoretical Computer Science , December 15-17, 2014, New Delhi, India.

Henzinger, Thomas A and Sezgin, Ali (2013) How Free is Your Linearizable Concurrent Data Structure? Technical Report. IST Austria.

Henzinger, Thomas A and Sezgin, Ali and Viktor, Vafeiadis (2013) Aspect-Oriented Linearizability Proofs. In: CONCUR: Concurrency Theor, August 27-30, 2013 , Buenos Aires, Argentina .

Henzinger, Thomas A and Singh, Anmol V and Singh, Vasu and Wies, Thomas and Zufferey, Damien (2010) FlexPRICE: Flexible provisioning of resources in a cloud environment. In: CLOUD: Cloud Computing, July 5-10, 2010, Miami, FL.

Hilbe, Christian and Hagel, Kristin and Milinski, Manfred (2016) Asymmetric power boosts extortion in an economic experiment. PLoS One, 11 (10). Article number: e0163867 . ISSN 1932-6203

J

Jain, Abhishek and Krenn, Stephan and Pietrzak, Krzysztof and Tentes, Aris (2012) Commitments and efficient zero knowledge proofs from learning parity with noise. In: ASIACRYPT: International Conference on the Theory and Application of Cryptology and Information Security, December 2-6, 2012 , Beijing, China .

Jetchev, Dimitar P and Pietrzak, Krzysztof (2014) How to fake auxiliary input. In: TCC: Theory of Cryptography Conference, February 24-26, 2014, San Diego, CA, USA.

Jiang, Yu and Liu, Han and Song, Houbing and Kong, Hui and Gu, Ming and Sun, Jiaguang and Sha, Lui (2016) Safety assured formal model driven design of the multifunction vehicle bus controller. In: FM: International Symposium on Formal Methods, November 9-11, 2016, Limassol, Cyprus.

K

Kiltz, Eike and Pietrzak, Krzysztof and Szegedy, Mario (2013) Digital signatures with minimal overhead from indifferentiable random invertible functions. In: CRYPTO: International Cryptology Conference, August 18-22, 2013, Santa Barbara, CA, USA.

Krenn , Stephan and Pietrzak, Krzysztof and Wadia, Akshay and Wichs, Daniel (2016) A counterexample to the chain rule for conditional HILL entropy. Computational Complexity, 25 (3). pp. 567-505. ISSN 1420-8954

M

Michaliszyn, Jakub and Otop, Jan (2013) Elementary Modal Logics over Transitive Structures. In: Elementary Modal Logics over Transitive Structures. LIPIcs, 23 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, pp. 563-577. ISBN 978-3-939897-60-6

N

Ničković, Dejan and Piterman, Nir (2010) From MTL to deterministic timed automata. In: FORMATS: Formal Modeling and Analysis of Timed Systems, September 8-10, 2010, Klosterneuburg, Austria.

R

Reite, Johannes G and Makohon-Moore, Alvin P and Gerold, Jeffrey M and Bozic, Ivana and Chatterjee, Krishnendu and Iacobuzio-Donahue, Christine A and Vogelstein, Bert and Nowak, Martin A (2017) Reconstructing metastatic seeding patterns of human cancers. Nature Communications, 8. Article number: 14114 . ISSN 2041-1723

Rolinek, Michal (2017) Complexity of constraint satisfaction. PhD thesis, IST Austria.

T

Tripakis, Stavros and Lickly, Ben and Henzinger, Thomas A and Lee, Edward A (2009) On relational interfaces. In: EMSOFT: ACM International Conference on Embedded Software, October 11-16, 2009, Grenoble, France.

W

Wies, Thomas and Zufferey, Damien and Henzinger, Thomas A (2010) Forward analysis of depth-bounded processes. In: FoSSaCS: Foundations of Software Science and Computation Structures, March 20-28, 2010, Paphos, Cyprus.

Č

Černý, Pavol and Chatterjee, Krishnendu and Henzinger, Thomas A and Radhakrishna, Arjun and Singh, Rohit (2011) Quantitative synthesis for concurrent programs. In: CAV: Computer Aided Verification, July 14-20, 2011, Snowbird, UT, USA.

Černý, Pavol and Henzinger, Thomas A and Radhakrishna, Arjun and Ryzhyk, Leonid and Tarrach, Thorsten (2013) Efficient Synthesis for Concurrency by Semantics-Preserving Transformations. Computer Aided Verification '13, 8044. pp. 951-967.

Černý, Pavol and Radhakrishna, Arjun and Zufferey, Damien and Chaudhuri, Swarat and Alur, Rajeev (2010) Model checking of linearizability of concurrent list implementations. Technical Report. IST Austria.

This list was generated on Sun Aug 20 01:00:10 2017 CEST.