![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Sebastiano Vigna Sebastiano Vigna: Automatic Generation of Content Management Systems from EER-Based Specifications. ASE 2003 : 259-262 Paolo Boldi , Sebastiano Vigna: Lower bounds for weak sense of direction. J. Discrete Algorithms 1 (2): 119-128 (2003) Sebastiano Vigna: Multirelational Semantics for ExtendedEntity-Relationship Schemata with Applications. ER 2002 : 35-49 Paolo Boldi , Sebastiano Vigna: Holographic Trees. LATIN 2002 : 465-478 Paolo Boldi , Sebastiano Vigna: Universal dynamic synchronous self-stabilization. Distributed Computing 15 (3): 137-153 (2002) Paolo Boldi , Massimo Santini , Sebastiano Vigna: Measuring with jugs. Theor. Comput. Sci. 282 (2): 259-270 (2002) Paolo Boldi , Sebastiano Vigna: An Effective Characterization of Computability in Anonymous Networks. DISC 2001 : 33-47 Paolo Boldi , Bruno Codenotti , Massimo Santini , Sebastiano Vigna: Trovatore: Towards a Highly Scalable Distributed Web Crawler. WWW Posters 2001 Charles Meyssonnier , Paolo Boldi , Sebastiano Vigna: delta-Approximable Functions. CCA 2000 : 187-199 Paolo Boldi , Sebastiano Vigna: More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs. DISC 2000 : 238-252 Paolo Boldi , Sebastiano Vigna: Lower bounds for (weak) sense of direction. SIROCCO 2000 : 37-46 Paolo Boldi , Sebastiano Vigna: Coverings that preserve sense of direction. Inf. Process. Lett. 75 (4): 175-180 (2000) Paolo Boldi , Sebastiano Vigna: The Turing closure of an Archimedean field. Theor. Comput. Sci. 231 (2): 143-156 (2000) Paolo Boldi , Sebastiano Vigna: Computing Anonymously with Arbitrary Knowledge. PODC 1999 : 181-188 Paolo Boldi , Sebastiano Vigna: Complexity of Deciding Sense of Direction. SIAM J. Comput. 29 (3): 779-789 (1999) Paolo Boldi , Sebastiano Vigna: Equality is a Jump. Theor. Comput. Sci. 219 (1-2): 49-64 (1999) Paolo Boldi , Sebastiano Vigna: Computing Vector Functions on Anonymous Networks. PODC 1997 : 277 Paolo Boldi , Sebastiano Vigna: Computing Vector Functions on Anonymous Networks. SIROCCO 1997 : 201-214 Stefano Kasangian , Sebastiano Vigna: The Topos of Labelled Trees: A Categorical Semantics for SCCS. Fundam. Inform. 32 (1): 27-45 (1997) Paolo Boldi , Sebastiano Vigna: Minimal Sense of Direction and Decision Problems for Cayley Graphs. Inf. Process. Lett. 64 (6): 299-303 (1997) Paolo Boldi , Shella Shammah , Sebastiano Vigna, Bruno Codenotti , Peter Gemmell , Janos Simon : Symmetry Breaking in Anonymous Networks: Characterizations. ISTCS 1996 : 16-26 Paolo Boldi , Sebastiano Vigna: Good Fibrations and Other Construction Which Preserve Sense of Direction. SIROCCO 1996 : 47-58 Nicoletta Sabadini , Sebastiano Vigna, Robert F. C. Walters : A Note on Recursive Functions. Mathematical Structures in Computer Science 6 (2): 127-139 (1996) Sebastiano Vigna: On the Relations between Distributive Computability and the BSS Model. Theor. Comput. Sci. 162 (1): 5-21 (1996) Paolo Boldi , Sebastiano Vigna: On the Complexity of Deciding Sense of Direction. SIROCCO 1995 : 39-51 Nicoletta Sabadini , Sebastiano Vigna, Robert F. C. Walters : A Notion of Refinement for Automata. AMAST 1993 : 325-332 Pierpaolo Degano , Roberto Gorrieri , Sebastiano Vigna: On Relating Some Models for Concurrency. TAPSOFT 1993 : 15-30 Pierpaolo Degano , Stefano Kasangian , Sebastiano Vigna: Applications of the Calculus of Trees to Process Description Languages. Category Theory and Computer Science 1991 : 282-301 Stefano Kasangian , Sebastiano Vigna: Introducing a Calculus of Trees. TAPSOFT, Vol.1 1991 : 215-240 1 [ 5 ] [ 8 ] [ 9 ] [ 10 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 20 ] [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] [ 28 ] 2 [ 9 ] [ 22 ] 3 [ 2 ] [ 3 ] 4 [ 9 ] 5 [ 3 ] 6 [ 1 ] [ 2 ] [ 11 ] 7 [ 21 ] 8 [ 4 ] [ 7 ] 9 [ 22 ] [ 24 ] 10 [ 9 ] 11 [ 9 ] 12 [ 4 ] [ 7 ] ![]() ©2004 Association for Computing Machinery |