Sciweavers

49 search results - page 7 / 10
» On-line Ramsey Theory
Sort
View
FCT
1999
Springer
13 years 11 months ago
On Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directi...
Manfred Droste, Dietrich Kuske
BIRTHDAY
1997
Springer
13 years 10 months ago
Expressive Power of Unary Counters
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
Michael Benedikt, H. Jerome Keisler
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
13 years 7 months ago
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
David Eppstein
SYNTHESE
2008
78views more  SYNTHESE 2008»
13 years 6 months ago
Room for a view: on the metaphysical subject of personal identity
Sydney Shoemaker leads today's "neo-Lockean" liberation of persons from the conservative animalist charge of "neo-Aristotelians" such as Eric Olson, accord...
Daniel Kolak
CADE
2011
Springer
12 years 6 months ago
ASASP: Automated Symbolic Analysis of Security Policies
We describe asasp, a symbolic reachability procedure for the analysis of administrative access control policies. The tool represents access policies and their administrative action...
Francesco Alberti, Alessandro Armando, Silvio Rani...