Sciweavers

199 search results - page 38 / 40
» Connectivity of addable graph classes
Sort
View
138
Voted
VMCAI
2010
Springer
15 years 10 months ago
Building a Calculus of Data Structures
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
Viktor Kuncak, Ruzica Piskac, Philippe Suter, Thom...
COCOON
2009
Springer
15 years 7 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta
106
Voted
ICALP
2005
Springer
15 years 6 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
105
Voted
INFOCOM
2002
IEEE
15 years 5 months ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic
115
Voted
SIAMDM
1998
89views more  SIAMDM 1998»
15 years 13 days ago
String Noninclusion Optimization Problems
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...
Anatoly R. Rubinov, Vadim G. Timkovsky