Sciweavers

373 search results - page 1 / 75
» Counting in Trees for Free
Sort
View
ICALP
2004
Springer
13 years 10 months ago
Counting in Trees for Free
Helmut Seidl, Thomas Schwentick, Anca Muscholl, Pe...
JCB
1998
105views more  JCB 1998»
13 years 5 months ago
Constructing and Counting Phylogenetic Invariants
Abstract. The method of invariants is an approach to the problem of reconstructing the phylogenetic tree of a collection of m taxa using nucleotide sequence data. Models for the re...
Steven N. Evans, Xiaowen Zhou
PODC
1993
ACM
13 years 9 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
ADHOCNOW
2007
Springer
13 years 11 months ago
Routing in Wireless Networks with Position Trees
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
Edgar Chávez, Nathalie Mitton, Hécto...
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 5 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...