Sciweavers

1011 search results - page 118 / 203
» The three dimensions of proofs
Sort
View
JCT
2007
90views more  JCT 2007»
15 years 6 months ago
On the maximum number of edges in quasi-planar graphs
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
Eyal Ackerman, Gábor Tardos
ENTCS
2002
136views more  ENTCS 2002»
15 years 6 months ago
Comparing Calculi of Explicit Substitutions with Eta-reduction
The past decade has seen an explosion of work on calculi of explicit substitutions. Numerous work has illustrated the usefulness of these calculi for practical notions like the im...
Mauricio Ayala-Rincón, Flávio L. C. ...
ICICS
2010
Springer
15 years 4 months ago
Unconditionally Secure First-Price Auction Protocols Using a Multicomponent Commitment Scheme
Due to the rapid growth of e-commerce technology, secure auction protocols have attracted much attention among researchers. The main reason for constructing sealed-bid auction prot...
Mehrdad Nojoumian, Douglas R. Stinson
TCS
2011
15 years 1 months ago
The transposition median problem is NP-complete
During the last years, the genomes of more and more species have been sequenced, providing data for phylogenetic reconstruction based on genome rearrangement measures, where the m...
Martin Bader
CSFW
2012
IEEE
13 years 8 months ago
Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...
Valerio Genovese, Deepak Garg, Daniele Rispoli