default search action
Theoretical Computer Science, Volume 283
Volume 283, Number 1, June 2002
- Gilles Bertrand, Rémy Malgouyres:
Discrete Geometry for Computer Imagery - Preface. 1 - T. Yung Kong:
Topological adjacency relations on Zn. 3-28 - Rafael Ayala, Eladio Domínguez, Angel R. Francés, Antonio Quintero:
Weak lighting functions and strong 26-surfaces. 29-66 - Rémy Malgouyres, Malika More:
On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology. 67-108 - Sébastien Fourey, Rémy Malgouyres:
Intersection number and topology preservation within digital surfaces. 109-150 - Valentin E. Brimkov, Reneta P. Barneva:
Graceful planes and lines. 151-170 - Yan Gérard:
Periodic graphs and connectivity of the rational digital hyperplanes. 171-182 - Marie-Andrée Jacob-Da Col:
About local configurations in arithmetic planes. 183-201 - Olivier Devillers, Pierre-Marie Gandoin:
Rounding Voronoi diagram. 203-221 - Attila Kuba, Emese Balogh:
Reconstruction of convex 2D discrete sets in polynomial time. 223-242 - Mohamed Tajine, Christian Ronse:
Topological properties of Hausdorff discretization, and comparison to other discretization schemes. 243-268
Volume 283, Number 2, June 2002
- Roberto Gorrieri:
Editorial. 269-270 - Chiara Bodei, Pierpaolo Degano, Riccardo Focardi, Corrado Priami:
Primitives for authentication in process algebras. 271-304 - Ewen Denney, Thomas P. Jensen:
Correctness of Java card method lookup via logical relations. 305-331 - Joshua D. Guttman, F. Javier Thayer:
Authentication tests and the structure of bundles. 333-380 - Flemming Nielson, Hanne Riis Nielson, René Rydhof Hansen:
Validating firewalls using flow logics. 381-418 - Vitaly Shmatikov, John C. Mitchell:
Finite-state analysis of two contract signing protocols. 419-450
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.