dblp.uni-trier.dewww.uni-trier.de

Stefano Marcugini Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
33EEJürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco: The non-existence of a [[13,5,4]] quantum stabilizer code CoRR abs/0908.1348: (2009)
32EEAlexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco: Some combinatorial aspects of constructing bipartite-graph codes CoRR abs/0909.5669: (2009)
31EEAlexander A. Davydov, Stefano Marcugini, Fernanda Pambianco: Complete ( q 2 + q + 8)/2-caps in the spaces PG (3, q ), q = 2 (mod 3) an odd prime, and a complete 20-cap in PG (3, 5). Des. Codes Cryptography 50(3): 359-372 (2009)
30EEJürgen Bierbrauer, Yves Edel, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco: Short Additive Quaternary Codes. IEEE Transactions on Information Theory 55(3): 952-954 (2009)
2008
29 Olof Heden, Stefano Marcugini, Fernanda Pambianco, Leo Storme: On the non-existence of a maximal partial spread of size 76 in PG(3, 9). Ars Comb. 89: (2008)
2007
28EEStefano Marcugini, Alfredo Milani, Fernanda Pambianco: Complete arcs in PG(2, 25): The spectrum of the sizes and the classification of the smallest complete arcs. Discrete Mathematics 307(6): 739-747 (2007)
2006
27EEEmanuela Falcinelli, Stefano Marcugini, Alfredo Milani: An Architecture for Dynamical News Providers. IAT Workshops 2006: 200-203
26EEJürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco: The smallest size of a complete cap in PG(3, 7). Discrete Mathematics 306(13): 1257-1263 (2006)
25EEAlexander A. Davydov, Stefano Marcugini, Fernanda Pambianco: Minimal 1-saturating sets and complete caps in binary projective spaces. J. Comb. Theory, Ser. A 113(4): 647-663 (2006)
2005
24EEAlfredo Milani, Silvia Suriani, Stefano Marcugini: Evolutionary online services. ICEC 2005: 343-349
23EEAlfredo Milani, Stefano Marcugini: An Architecture for Evolutionary Adaptive Web Systems. WINE 2005: 444-454
22EEStefano Marcugini, Alfredo Milani, Fernanda Pambianco: Maximal (n, 3)-arcs in PG(2, 13). Discrete Mathematics 294(1-2): 139-145 (2005)
21EEJürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco: A family of highly symmetric codes. IEEE Transactions on Information Theory 51(10): 3665-3668 (2005)
20EEAlexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco: Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces. IEEE Transactions on Information Theory 51(12): 4378-4387 (2005)
2004
19 Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco: Linear codes with covering radius 2, 3 and saturating sets in projective geometry. IEEE Transactions on Information Theory 20(3): 537-541 (2004)
2003
18EEJürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco: Projective Planes, Coverings and a Network Problem. Des. Codes Cryptography 29(1-3): 71-89 (2003)
17EEAlexander A. Davydov, Stefano Marcugini, Fernanda Pambianco: On saturating sets in projective spaces. J. Comb. Theory, Ser. A 103(1): 1-15 (2003)
2002
16EEGiorgio Faina, György Kiss, Stefano Marcugini, Fernanda Pambianco: The Cyclic Model for PG(n,q) and a Construction of Arcs. Eur. J. Comb. 23(1): 31-35 (2002)
15 Stefano Marcugini, Alfredo Milani, Fernanda Pambianco: NMDS Codes of maximal length over Fq, 8 <= q <= 11. IEEE Transactions on Information Theory 48(4): 963-966 (2002)
2001
14 Stefano Marcugini, Alfredo Milani, Fernanda Pambianco: Classification of the [n, 3, n-3]_q NMDS codes over GF(7), GF(8) and GF(9). Ars Comb. 61: (2001)
2000
13 Marco Baioletti, Stefano Marcugini, Alfredo Milani: DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph. AIPS 2000: 13-21
1999
12EEStefano Marcugini, Alfredo Milani, Fernanda Pambianco: Maximal (n, 3)-arcs in PG(2, 11). Discrete Mathematics 208-209: 421-426 (1999)
1998
11EEMarco Baioletti, Stefano Marcugini, Alfredo Milani: An Extension of SATPLAN for Planning with Constraints. AIMSA 1998: 39-49
10 Marco Baioletti, Stefano Marcugini, Alfredo Milani: Encoding Planning Constraints into Partial Order Planners. KR 1998: 608-616
9 Giorgio Faina, Stefano Marcugini, Alfredo Milani, Fernanda Pambianco: The sizes k of the complete k-caps in PG(n, q), for small q and 3 <= n >= 5. Ars Comb. 50: (1998)
1997
8 Marco Baioletti, Stefano Marcugini, Alfredo Milani: Compiling Task Networks into Partial Order Planning Domains. AI*IA 1997: 311-321
7 Marco Baioletti, Stefano Marcugini, Alfredo Milani: Task Planning and Partial Order Planning: A Domain Transformation Approach. ECP 1997: 52-63
6 Giorgio Faina, Stefano Marcugini, Alfredo Milani, Fernanda Pambianco: The Spectrum of Values k for which there Exists a Complete k-Arc in PG(2, q) for q<=23. Ars Comb. 47: (1997)
1996
5 Marco Baioletti, Stefano Marcugini, Alfredo Milani: Encapsulation of Actions and Plans in Conditional Planning Systems. IEA/AIE 1996: 665-672
1995
4 Marco Baioletti, Stefano Marcugini, Alfredo Milani: A Weakest Precondition Semantics for Conditional Planning. AI*IA 1995: 291-302
1992
3 Stefano Marcugini, Alfredo Milani, Maurizio Terragnolo: Plans as Planning Objects. AIMSA 1992: 35-44
1991
2 Bruno Fringuelli, Stefano Marcugini, Alfredo Milani, Silvano Rivoira: Truth Maintenance in Approximate Reasoning. AI*IA 1991: 430-434
1EEBruno Fringuelli, Stefano Marcugini, Alfredo Milani, Silvano Rivoira: A Reason Maintenance System Dealing with Vague Data. UAI 1991: 111-117

Coauthor Index

1Marco Baioletti [4] [5] [7] [8] [10] [11] [13]
2Jürgen Bierbrauer [18] [21] [26] [30] [33]
3Alexander A. Davydov [17] [19] [20] [25] [31] [32]
4Yves Edel [30]
5Giorgio Faina [6] [9] [16] [20] [30]
6Emanuela Falcinelli [27]
7Bruno Fringuelli [1] [2]
8Massimo Giulietti [32]
9Olof Heden [29]
10György Kiss [16]
11Alfredo Milani [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [22] [23] [24] [27] [28]
12Fernanda Pambianco [6] [9] [12] [14] [15] [16] [17] [18] [19] [20] [21] [22] [25] [26] [28] [29] [30] [31] [32] [33]
13Silvano Rivoira [1] [2]
14Leo Storme [29]
15Silvia Suriani [24]
16Maurizio Terragnolo [3]

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)