4850 search results - page 875 / 970 » Proof and Computation in Geometry |
95
Voted
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
100
click to vote
WG
2005
Springer
15 years 6 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
101
click to vote
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
107
Voted
BIRTHDAY
2000
Springer
15 years 5 months ago
2000
Springer
Niklaus Wirth has received much deserved fame for the creation of Pascal, but in many ways, he subsequently became a victim of Pascal's success. In an age of rising specializ...
ERSHOV
1989
Springer
15 years 4 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...