Sciweavers

96 search results - page 14 / 20
» On Several Proofs of the Recognizability Theorem
Sort
View
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
15 years 3 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
APLAS
2001
ACM
15 years 3 months ago
Verifying the CPS Transformation in Isabelle/HOL
We verified two versions of the CPS transformation in Isabelle/HOL: one by Plotkin by Danvy and Filinski. We adopted first order abstract syntax so that the formalization is close...
Yasuhiko Minamide, Koji Okuma
APLAS
2003
ACM
15 years 3 months ago
Executing Verified Compiler Specification
Abstract. Much work has been done in verifying a compiler specification, both in hand-written and mechanical proofs. However, there is still a gap between a correct compiler specif...
Koji Okuma, Yasuhiko Minamide
CORR
2007
Springer
120views Education» more  CORR 2007»
14 years 11 months ago
A Deterministic Approach to Wireless Relay Networks
—We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected...
Amir Salman Avestimehr, Suhas N. Diggavi, David N....
CCCG
2010
15 years 1 months ago
Existence of zone diagrams in compact subsets of uniformly convex spaces
A zone diagram is a relatively new concept which has emerged in computational geometry and is related to Voronoi diagrams. Formally, it is a fixed point of a certain mapping, and ...
Eva Kopecká, Daniel Reem, Simeon Reich