| Year |
Citation |
Score |
| 2020 |
Romanelli M, Chatzikokolakis K, Palamidessi C. Optimal Obfuscation Mechanisms via Machine Learning Cell Structure and Function. 153-168. DOI: 10.1109/Csf49147.2020.00019 |
0.314 |
|
| 2020 |
Castiglioni V, Chatzikokolakis K, Palamidessi C. A Logical Characterization of Differential Privacy Science of Computer Programming. 188: 102388. DOI: 10.1016/J.Scico.2019.102388 |
0.418 |
|
| 2019 |
Chatzikokolakis K, Fernandes N, Palamidessi C. Comparing Systems: Max-Case Refinement Orders and Application to Differential Privacy Cell Structure and Function. 442-457. DOI: 10.1109/Csf.2019.00037 |
0.383 |
|
| 2018 |
Alvim MS, Chatzikokolakis K, Kawamoto Y, Palamidessi C. A Game-Theoretic Approach to Information-Flow Control via Protocol Composition. Entropy (Basel, Switzerland). 20. PMID 33265472 DOI: 10.3390/E20050382 |
0.359 |
|
| 2017 |
Hamadou S, Palamidessi C, Sassone V. Quantifying leakage in the presence of unreliable sources of information Journal of Computer and System Sciences. 88: 27-52. DOI: 10.1016/J.Jcss.2017.03.013 |
0.332 |
|
| 2015 |
Alvim MS, Andrés ME, Chatzikokolakis K, Degano P, Palamidessi C. On the information leakage of differentially-private mechanisms Journal of Computer Security. 23: 427-469. DOI: 10.3233/Jcs-150528 |
0.375 |
|
| 2015 |
Gazeau I, Miller D, Palamidessi C. Preserving differential privacy under finite-precision semantics Theoretical Computer Science. DOI: 10.1016/J.Tcs.2016.01.015 |
0.416 |
|
| 2014 |
Falaschi M, Olarte C, Palamidessi C. Abstract interpretation of temporal concurrent constraint programs Theory and Practice of Logic Programming. 15. DOI: 10.1017/S1471068413000641 |
0.388 |
|
| 2014 |
Chatzikokolakis K, Gebler D, Palamidessi C, Xu L. Generalized bisimulation metrics Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8704: 32-46. DOI: 10.1007/978-3-662-44584-6_4 |
0.32 |
|
| 2013 |
Chatzikokolakis K, Andrés ME, Bordenabe NE, Palamidessi C. Broadening the scope of differential privacy using metrics Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7981: 82-102. DOI: 10.1007/978-3-642-39077-7_5 |
0.303 |
|
| 2012 |
Chatzikokolakis K, Knight S, Palamidessi C, Panangaden P. Epistemic strategies and games on concurrent processes Acm Transactions On Computational Logic. 13. DOI: 10.1145/2362355.2362356 |
0.349 |
|
| 2010 |
Andrés ME, Palamidessi C, Van Rossum P, Sokolova A. Information hiding in probabilistic concurrent systems Proceedings - 7th International Conference On the Quantitative Evaluation of Systems, Qest 2010. 17-26. DOI: 10.1016/J.Tcs.2011.02.045 |
0.376 |
|
| 2010 |
Chatzikokolakis K, Palamidessi C. Making random choices invisible to the scheduler Information and Computation. 208: 694-715. DOI: 10.1016/J.Ic.2009.06.006 |
0.511 |
|
| 2010 |
Andrés ME, Palamidessi C, Van Rossum P, Smith G. Computing the leakage of information-hiding systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6015: 373-389. DOI: 10.1007/978-3-642-12002-2_32 |
0.303 |
|
| 2009 |
Kramer S, Palamidessi C, Segala R, Turrini A, Christelle Braun CB. A quantitative doxastic logic for probabilistic processes and applications to information-hiding Journal of Applied Non-Classical Logics. 19: 489-516. DOI: 10.3166/Jancl.19.489-516 |
0.37 |
|
| 2009 |
Cacciagrano D, Corradini F, Palamidessi C. Explicit Fairness in Testing Semantics Logical Methods in Computer Science. 5: 1-29. DOI: 10.2168/Lmcs-5(2:15)2009 |
0.388 |
|
| 2009 |
Norman G, Palamidessi C, Parker D, Wu P. Model checking probabilistic and stochastic extensions of the π-calculus Ieee Transactions On Software Engineering. 35: 209-223. DOI: 10.1109/Tse.2008.77 |
0.411 |
|
| 2009 |
Braun C, Chatzikokolakis K, Palamidessi C. Quantitative Notions of Leakage for One-try Attacks Electronic Notes in Theoretical Computer Science. 249: 75-91. DOI: 10.1016/J.Entcs.2009.07.085 |
0.346 |
|
| 2008 |
Braun C, Chatzikokolakis K, Palamidessi C. Compositional methods for information-hiding Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4962: 443-457. DOI: 10.1017/S0960129514000292 |
0.394 |
|
| 2008 |
Chatzikokolakis K, Palamidessi C, Panangaden P. Anonymity protocols as noisy channels Information and Computation. 206: 378-401. DOI: 10.1016/J.Ic.2007.07.003 |
0.318 |
|
| 2007 |
Norman G, Palamidessi C, Parker D, Wu P. Model checking the probabilistic π-calculus Proceedings - 4th International Conference On the Quantitative Evaluation of Systems, Qest 2007. 169-178. DOI: 10.1109/QEST.2007.27 |
0.307 |
|
| 2007 |
Vigliotti MG, Phillips I, Palamidessi C. Tutorial on separation results in process calculi via leader election problems Theoretical Computer Science. 388: 267-289. DOI: 10.1016/j.tcs.2007.09.001 |
0.302 |
|
| 2007 |
Cacciagrano D, Corradini F, Palamidessi C. Fair Π Electronic Notes in Theoretical Computer Science. 175: 3-26. DOI: 10.1016/J.Entcs.2006.10.051 |
0.4 |
|
| 2007 |
Deng Y, Palamidessi C, Pang J. Weak Probabilistic Anonymity Electronic Notes in Theoretical Computer Science. 180: 55-76. DOI: 10.1016/J.Entcs.2005.05.047 |
0.404 |
|
| 2007 |
Goubault-Larrecq J, Palamidessi C, Troina A. A probabilistic Applied Pi-calculus Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4807: 175-190. |
0.399 |
|
| 2006 |
Cacciagrano D, Corradini F, Palamidessi C. Separation of Synchronous and Asynchronous Communication Via Testing Electronic Notes in Theoretical Computer Science. 154: 95-108. DOI: 10.1016/J.Tcs.2007.07.009 |
0.371 |
|
| 2006 |
Chatzikokolakis K, Palamidessi C. Probable innocence revisited Theoretical Computer Science. 367: 123-138. DOI: 10.1016/J.Tcs.2006.08.033 |
0.409 |
|
| 2006 |
Pradalier S, Palamidessi C. Expressiveness of Probabilistic π-calculus Electronic Notes in Theoretical Computer Science. 164: 119-136. DOI: 10.1016/J.Entcs.2006.07.015 |
0.423 |
|
| 2006 |
Palamidessi C. Anonymity in Probabilistic and Nondeterministic Systems Electronic Notes in Theoretical Computer Science. 162: 277-279. DOI: 10.1016/J.Entcs.2005.12.094 |
0.367 |
|
| 2006 |
Palamidessi C. Probabilistic and Nondeterministic Aspects of Anonymity Electronic Notes in Theoretical Computer Science. 155: 33-42. DOI: 10.1016/J.Entcs.2005.11.050 |
0.341 |
|
| 2006 |
Deng Y, Chothia T, Palamidessi C, Pang J. Metrics for Action-labelled Quantitative Transition Systems Electronic Notes in Theoretical Computer Science. 153: 79-96. DOI: 10.1016/J.Entcs.2005.10.033 |
0.317 |
|
| 2006 |
Ziegler A, Miller D, Palamidessi C. A Congruence Format for Name-passing Calculi Electronic Notes in Theoretical Computer Science. 156: 169-189. DOI: 10.1016/J.Entcs.2005.09.032 |
0.363 |
|
| 2006 |
Vigliotti MG, Phillips I, Palamidessi C. Separation results via leader election problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4111: 172-194. |
0.334 |
|
| 2005 |
Chatzikokolakis K, Palamidessi C. A framework for analyzing probabilistic protocols and its application to the partial secrets exchange Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3705: 146-162. DOI: 10.1016/J.Tcs.2007.09.006 |
0.433 |
|
| 2005 |
Deng Y, Palamidessi C. Axiomatizations for probabilistic finite-state behaviors Lecture Notes in Computer Science. 3441: 110-124. DOI: 10.1016/J.Tcs.2006.12.008 |
0.351 |
|
| 2005 |
Palamidessi C, Herescu OM. A randomized encoding of the π-calculus with mixed choice Theoretical Computer Science. 335: 373-404. DOI: 10.1016/J.Tcs.2004.11.020 |
0.72 |
|
| 2005 |
Deng Y, Palamidessi C, Pang J. Compositional reasoning for probabilistic finite-state behaviors Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3838: 309-337. DOI: 10.1007/11601548_17 |
0.399 |
|
| 2005 |
Bhargava M, Palamidessi C. Probabilistic anonymity Lecture Notes in Computer Science. 3653: 171-185. |
0.326 |
|
| 2003 |
Palamidessi C. Comparing the expressive power of the synchronous and asynchronous $pi$-calculi Mathematical Structures in Computer Science. 13: 685-719. DOI: 10.1017/S0960129503004043 |
0.358 |
|
| 2003 |
McDowell R, Miller D, Palamidessi C. Encoding transition systems in sequent calculus Theoretical Computer Science. 294: 411-437. DOI: 10.1016/S0304-3975(01)00168-2 |
0.339 |
|
| 2002 |
Nielsen M, Palamidessi C, Valencia FD. On the Expressive Power of Concurrent Constraint Programming Languages Brics Report Series. 9. DOI: 10.7146/Brics.V9I22.21738 |
0.373 |
|
| 2002 |
Palamidessi C, Nielsen M, Valencia FD. On the Expressive Power of Temporal Concurrent Constraint Programming Languages: (invited talk) Electronic Notes in Theoretical Computer Science. 68: 3. DOI: 10.1016/S1571-0661(05)80359-7 |
0.37 |
|
| 2002 |
Palamidessi C. Mobile calculi for distributed programming Proceedings of the Acm Sigplan Conference On Principles and Practice of Declarative Programming (Ppdp'02). 74-75. |
0.352 |
|
| 2002 |
Palamidessi C, Herescu OM. A randomized distributed encoding of the π-calculus with mixed choice Ifip Advances in Information and Communication Technology. 96: 537-549. |
0.726 |
|
| 2001 |
Palamidessi C, Valencia FD. A temporal concurrent constraint programming calculus Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2239: 302-316. DOI: 10.7146/Brics.V8I20.21681 |
0.398 |
|
| 2001 |
Herescu OM, Palamidessi C. On the generalized dining philosophers problem Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 81-89. |
0.694 |
|
| 2000 |
Gilbert D, Palamidessi C. Concurrent constraint programming with process mobility Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 1861: 463-477. DOI: 10.1007/3-540-44957-4_31 |
0.377 |
|
| 2000 |
Herescu OM, Palamidessi C. Probabilistic asynchronous φ-calculus Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1784: 146-160. |
0.719 |
|
| 1997 |
De Boer FS, Gabbrielli M, Marchiori E, Palamidessi C. Proving Concurrent Constraint Programs Correct Acm Transactions On Programming Languages and Systems. 19: 685-725. DOI: 10.1145/265943.265954 |
0.336 |
|
| 1997 |
De Boer FS, Di Pierro A, Palamidessi C. An algebraic perspective of constraint logic programming Journal of Logic and Computation. 7: 1-38. DOI: 10.1093/Logcom/7.1.1 |
0.399 |
|
| 1997 |
Palamidessi C, Parrow J. Electronic Notes in Theoretical Computer Science: Foreword Electronic Notes in Theoretical Computer Science. 7: 1-2. DOI: 10.1016/S1571-0661(05)80461-X |
0.308 |
|
| 1997 |
Falaschi M, Gabbrielli M, Marriott K, Palamidessi C. Confluence in concurrent constraint programming Theoretical Computer Science. 183: 281-315. DOI: 10.1007/3-540-60043-4_76 |
0.309 |
|
| 1997 |
Best E, De Boer FS, Palamidessi C. Partial order and sos semantics for linear constraint programs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1282: 256-273. |
0.324 |
|
| 1996 |
McDowell R, Miller D, Palamidessi C. Encoding Transition Systems in Sequent Calculus: Preliminary Report Electronic Notes in Theoretical Computer Science. 3: 138-152. DOI: 10.1016/S1571-0661(05)80412-8 |
0.382 |
|
| 1995 |
Cortesi A, Filé G, Giacobazzi R, Palamidessi C, Ranzato F. Complementation in abstract interpretation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 983: 100-117. DOI: 10.1145/239912.239914 |
0.309 |
|
| 1995 |
de Boer FS, Di Pierro A, Palamidessi C. Nondeterminism and infinite computations in constraint programming Theoretical Computer Science. 151: 37-78. DOI: 10.1016/0304-3975(95)00047-Z |
0.369 |
|
| 1995 |
Dipierro A, Martelli M, Palamidessi C. Negation as Instantiation Information and Computation. 120: 263-278. DOI: 10.1006/Inco.1995.1113 |
0.304 |
|
| 1994 |
Deboer FS, Palamidessi C. Embedding as a Tool for Language Comparison Information and Computation. 108: 128-157. DOI: 10.1006/Inco.1994.1004 |
0.408 |
|
| 1993 |
Falaschi M, Levi G, Martelli M, Palamidessi C. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs Information and Computation. 103: 86-113. DOI: 10.1006/Inco.1993.1015 |
0.394 |
|
| 1992 |
de Boer FS, Kok JN, Palamidessi C, Rutten JJMM. From failure to success: comparing a denotational and a declarative semantics for Horn clause logic Theoretical Computer Science. 101: 239-263. DOI: 10.1016/0304-3975(92)90051-G |
0.362 |
|
| 1992 |
Haridi S, Janson S, Palamidessi C. Structural operational semantics for AKL Future Generation Computer Systems. 8: 409-421. DOI: 10.1016/0167-739X(92)90072-J |
0.403 |
|
| 1991 |
de Boer FS, Rutten JJMM, Kok JN, Palamidessi C. Semantic models for concurrent logic languages Theoretical Computer Science. 86: 3-33. DOI: 10.1016/0304-3975(91)90003-K |
0.423 |
|
| 1991 |
Giovannetti E, Levi G, Moiso C, Palamidessi C. Kernel-LEAF: A logic plus functional language Journal of Computer and System Sciences. 42: 139-185. DOI: 10.1016/0022-0000(91)90009-T |
0.383 |
|
| 1989 |
Falaschi M, Levi G, Palamidessi C, Martelli M. Declarative modeling of the operational behavior of logic languages Theoretical Computer Science. 69: 289-318. DOI: 10.1016/0304-3975(89)90070-4 |
0.391 |
|
| 1988 |
Levi G, Palamidessi C. Contributions to the semantics of logic perpetual processes Acta Informatica. 25: 691-711. DOI: 10.1007/Bf00291055 |
0.436 |
|
| 1985 |
Levi G, Palamidessi C. DECLARATIVE SEMANTICS OF LOGICAL READ-ONLY VARIABLES . 128-137. |
0.334 |
|
| 1984 |
Falaschi M, Levi G, Palamidessi C. A synchronization logic: Axiomatics and formal semantics of generalized horn clauses Information and Control. 60: 36-69. DOI: 10.1016/S0019-9958(84)80021-2 |
0.459 |
|
| Show low-probability matches. |