Sciweavers

1461 search results - page 154 / 293
» Complexity of Graph Covering Problems
Sort
View
STOC
2005
ACM
163views Algorithms» more  STOC 2005»
15 years 10 months ago
Undirected ST-connectivity in log-space
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
Omer Reingold
TCS
2008
14 years 10 months ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
ECOOPW
2004
Springer
15 years 3 months ago
Coordination and Adaptation Techniques for Software Entities
Abstract. Coordination and Adaptation are two key issues when developing complex distributed systems. Coordination focuses on the interaction among computational entities. Adaptati...
Carlos Canal, Juan Manuel Murillo, Pascal Poizat
EURODAC
1995
IEEE
142views VHDL» more  EURODAC 1995»
15 years 1 months ago
Prediction of radiated electromagnetic emissions from PCB traces based on green dyadics
Because it costs to solve ElectroMagnetic Compatibility (EMC) problems late in the development process, new methods have to predict radiated electromagnetic emissions at the desig...
E. Leroux, Flavio G. Canavero, G. Vecchi
AAAI
2007
15 years 14 days ago
Reasoning about Attribute Authenticity in a Web Environment
The reliable authentication of user attributes is an important prerequisite for the security of web based applications. Digital certificates are widely used for that purpose. How...
Thomas Wölfl