Sciweavers

338 search results - page 57 / 68
» Locally checkable proofs
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 9 months ago
Complexity dichotomy on partial grid recognition
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
Vinícius G. P. de Sá, Guilherme Dias...
ENTCS
2008
120views more  ENTCS 2008»
13 years 9 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke
CN
2006
117views more  CN 2006»
13 years 9 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
JSC
2008
58views more  JSC 2008»
13 years 9 months ago
A Groebner basis approach to solve a Conjecture of Nowicki
Let k be a field of characteristic zero, n any positive integer and let n be the derivation n i=1 Xi Yi of the polynomial ring k[X1, . . . , Xn, Y1, . . . , Yn] in 2n variables o...
Joseph Khoury
IJCSA
2007
143views more  IJCSA 2007»
13 years 9 months ago
Incremental Trade-Off Management for Preference-Based Queries
Preference-based queries often referred to as skyline queries play an important role in cooperative query processing. However, their prohibitive result sizes pose a severe challen...
Wolf-Tilo Balke, Ulrich Güntzer, Christoph Lo...