Sciweavers

ICALP
2004
Springer
14 years 6 months ago
Tree-Walking Automata Cannot Be Determinized
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...
Mikolaj Bojanczyk, Thomas Colcombet
ICALP
2004
Springer
14 years 6 months ago
Competition-Induced Preferential Attachment
Noam Berger, Christian Borgs, Jennifer T. Chayes, ...
ICALP
2004
Springer
14 years 6 months ago
Group Spreading: A Protocol for Provably Secure Distributed Name Service
In order to enable communication between a dynamic collection of peers with given ID’s, such as “machine.cs.school.edu”, over the Internet, a distributed name service must b...
Baruch Awerbuch, Christian Scheideler
ICALP
2004
Springer
14 years 6 months ago
Algorithms for Multi-product Pricing
In the information age, the availability of data on consumer profiles has opened new possibilities for companies to increase their revenue via data mining techniques. One approach...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
ICALP
2004
Springer
14 years 6 months ago
Learning a Hidden Subgraph
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
Noga Alon, Vera Asodi
ICALP
2004
Springer
14 years 6 months ago
Representing Nested Inductive Types Using W-Types
We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive types exist in any Martin-L¨of categ...
Michael Abbott, Thorsten Altenkirch, Neil Ghani
ICALP
2004
Springer
14 years 6 months ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...
ICALP
2004
Springer
14 years 6 months ago
Deciding Knowledge in Security Protocols Under Equational Theories
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
Martín Abadi, Véronique Cortier
ICALP
2004
Springer
14 years 6 months ago
The Power of Verification for One-Parameter Agents
We initiate the study of mechanisms with verification for one-parameter agents. We give an algorithmic characterization of such mechanisms and show that they are provably better ...
Vincenzo Auletta, Roberto De Prisco, Paolo Penna, ...