Sciweavers

234 search results - page 29 / 47
» Proof Nets and the Identity of Proofs
Sort
View
102
Voted
CORR
2011
Springer
138views Education» more  CORR 2011»
14 years 5 months ago
A new approach to nonrepetitive sequences
A sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long...
Jaroslaw Grytczuk, Jakub Kozik, Piotr Micek
GMP
2006
IEEE
102views Solid Modeling» more  GMP 2006»
15 years 4 months ago
Representing Topological Structures Using Cell-Chains
Abstract. A new topological representation of surfaces in higher dimensions, “cell-chains” is developed. The representation is a generalization of Brisson’s cell-tuple data s...
David E. Cardoze, Gary L. Miller, Todd Phillips
CSL
2008
Springer
14 years 12 months ago
Characterization of Logics over Ranked Tree Languages
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...
Thomas Place
APAL
2010
125views more  APAL 2010»
14 years 10 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 10 months ago
An Asymptotically Optimal RFID Authentication Protocol Against Relay Attacks
Abstract. Relay attacks are a major concern for RFID systems: during an authentication process an adversary transparently relays messages between a verifier and a remote legitimate...
Gildas Avoine, Aslan Tchamkerten