|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Sara Miner More, Pavel Naumov |
Logic of secrets in collaboration networks.  |
Ann. Pure Appl. Logic  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Miner More, Pavel Naumov |
Hypergraphs of multiparty secrets. |
Ann. Math. Artif. Intell. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Naumov, Brittany Nicholls |
Game Semantics for the Geiger-Paz-Pearl Axioms of Independence. |
LORI |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Miner More, Pavel Naumov |
The Functional Dependence Relation on Hypergraphs of Secrets. |
CLIMA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael S. Donders, Sara Miner More, Pavel Naumov |
Information Flow on Directed Acyclic Graphs. |
WoLLIC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Miner More, Pavel Naumov, Brittany Nicholls, Andrew Yang |
A ternary knowledge relation on secrets. |
TARK |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Miner More, Pavel Naumov, Benjamin Sapp |
Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence. |
CSL |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Miner More, Pavel Naumov |
An Independence Relation for Sets of Secrets. |
Studia Logica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Miner More, Pavel Naumov |
Functional Dependence of Secrets in a Collaboration Network |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sara Miner More, Pavel Naumov |
Hypergraphs of Multiparty Secrets. |
CLIMA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Kelvey, Sara Miner More, Pavel Naumov, Benjamin Sapp |
Independence and Functional Dependence Relations on Secrets. |
KR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sara Miner More, Pavel Naumov |
An Independence Relation for Sets of Secrets. |
WoLLIC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sara Miner More, Pavel Naumov |
On interdependence of secrets in collaboration networks. |
TARK |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Naumov |
On meta complexity of propositional formulas and propositional proofs. |
Arch. Math. Log. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03F20 |
| 1 | Pavel Naumov |
Logic of subtyping. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Naumov |
On modal logic of deductive closure. |
Ann. Pure Appl. Logic |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Naumov |
Upper bounds on complexity of Frege proofs with limited use of certain schemata. |
Arch. Math. Log. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Naumov |
On Modal Logics of Partial Recursive Functions. |
Studia Logica |
2005 |
DBLP DOI BibTeX RDF |
modal logic, recursive function, Curry-Howard isomorphism |
| 1 | Pavel Naumov |
On Modal Logics of Partial Recursive Functions |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Pavel Naumov, Mark-Oliver Stehr, José Meseguer |
The HOL/NuPRL Proof Translator (A Practical Approach to Formal Interoperability). |
TPHOLs |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert L. Constable, Paul B. Jackson, Pavel Naumov, Juan C. Uribe |
Constructively formalizing automata theory. |
Proof, Language, and Interaction |
2000 |
DBLP BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")