| 2013 | ||
|---|---|---|
| c13 | Kristine Harjes, Pavel Naumov: Functional Dependence in Strategic Games (extended abstract). SR 2013: 9-15 | |
| i3 | ||
| 2012 | ||
| j10 | ||
| j9 | Sara Miner More, Pavel Naumov: Calculus of cooperation and game-based reasoning about protocol privacy. ACM Trans. Comput. Log. 13(3): 22 (2012) | |
| c12 | ||
| 2011 | ||
| j8 | Sara Miner More, Pavel Naumov: Hypergraphs of multiparty secrets. Ann. Math. Artif. Intell. 62(1-2): 79-101 (2011) | |
| j7 | Sara Miner More, Pavel Naumov: Logic of secrets in collaboration networks. Ann. Pure Appl. Logic 162(12): 959-969 (2011) | |
| c11 | Sara Miner More, Pavel Naumov: The Functional Dependence Relation on Hypergraphs of Secrets. CLIMA 2011: 29-40 | |
| c10 | Sara Miner More, Pavel Naumov, Benjamin Sapp: Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence. CSL 2011: 443-457 | |
| c9 | Pavel Naumov, Brittany Nicholls: Game Semantics for the Geiger-Paz-Pearl Axioms of Independence. LORI 2011: 220-232 | |
| c8 | Sara Miner More, Pavel Naumov, Brittany Nicholls, Andrew Yang: A ternary knowledge relation on secrets. TARK 2011: 46-54 | |
| c7 | Michael S. Donders, Sara Miner More, Pavel Naumov: Information Flow on Directed Acyclic Graphs. WoLLIC 2011: 95-109 | |
| 2010 | ||
| j6 | Sara Miner More, Pavel Naumov: An Independence Relation for Sets of Secrets. Studia Logica 94(1): 73-85 (2010) | |
| c6 | ||
| c5 | Robert Kelvey, Sara Miner More, Pavel Naumov, Benjamin Sapp: Independence and Functional Dependence Relations on Secrets. KR 2010 | |
| i2 | Sara Miner More, Pavel Naumov: Functional Dependence of Secrets in a Collaboration Network. CoRR abs/1011.0399 (2010) | |
| 2009 | ||
| c4 | Sara Miner More, Pavel Naumov: On interdependence of secrets in collaboration networks. TARK 2009: 208-217 | |
| c3 | ||
| 2008 | ||
| j5 | Pavel Naumov: On meta complexity of propositional formulas and propositional proofs. Arch. Math. Log. 47(1): 35-52 (2008) | |
| 2006 | ||
| j4 | Pavel Naumov: Upper bounds on complexity of Frege proofs with limited use of certain schemata. Arch. Math. Log. 45(4): 431-446 (2006) | |
| j3 | ||
| j2 | ||
| 2005 | ||
| j1 | ||
| 2004 | ||
| i1 | ||
| 2001 | ||
| c2 | Pavel Naumov, Mark-Oliver Stehr, José Meseguer: The HOL/NuPRL Proof Translator (A Practical Approach to Formal Interoperability). TPHOLs 2001: 329-345 | |
| 2000 | ||
| c1 | Robert L. Constable, Paul B. Jackson, Pavel Naumov, Juan C. Uribe: Constructively formalizing automata theory. Proof, Language, and Interaction 2000: 213-238 | |
Colors in the list of coauthors
Last update Wed May 22 18:52:59 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page