21 search results - page 4 / 5 » stacs 2004 |
STACS
2004
Springer
15 years 3 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
STACS
2004
Springer
15 years 3 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
STACS
2004
Springer
15 years 3 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
STACS
2004
Springer
15 years 3 months ago
2004
Springer
Motivated by problems of pattern statistics, we study the limit distribution of the random variable counting the number of occurrences of the symbol a in a word of length n chosen...
IANDC
2007
14 years 10 months ago
2007
Cryptographic protocols can be divided into (1) protocols where the protocol steps are simple from a computational point of view and can thus be modeled by simple means, for insta...