Check for available options on the right hand side to narrow down or expand the list.Show all in one page (slower)
Technical Reports - DIT-02-019
Primitives for Authentication in Process Algebras
2001, Note: Appeared in Theoretical Computer Science 283/2
Keywords: Security, Authentication, Secrecy, Operational Semantics, Proved Transition Systems, DistribÂuted Process Algebras
Abstract: We extend the PÂÂ-calculus and the spi-Âcalculus with two primitives that guarantee authentica... See more
Technical Reports - DIT-02-018
Application of a stochastic name-Âpassing calculus to representation and simulation of molecular processes
2001, Note: Appeared in Information Processing Letters 80 (2001) 25-31
Keywords: stochastic P-calculus, bioinformatics, stochastic simulation
Abstract: We describe a novel application of a stochastic name passing calculus for the study of biomolecul... See more
Technical Reports - DIT-02-005
A Knowledge Level Software Engineering Methodology for Agent Oriented Programming
2000, Note: In proceedings of the Fifth International Conference on Autonomous Agents (Agents 2001), 2001.
Keywords: Agent-based software engineering, Design methodologies
Abstract: Our goal in this paper is to introduce and motivate a methodology, called Tropos, for building ag... See more
Technical Reports - DIT-02-081
Excluding a Simple Good Pair Approach to Directed Cuts
Keywords: Good pairs, Cut-trees, Directed connectivity, Counterexample
Abstract: In 1972, Mader proved that every undirected graph has a good pair, that is, an ordered pair (u,v)... See more
Technical Reports - DIT-02-053
Shortest Paths in Conservative Graphs
2000, Note: Published in: 2Discrete Mathematics" vol. 226 (2001) 143-153.
Keywords: undirected distances, conservative graphs, matching algorithm, optimal T-joins.
Abstract: We give a polynomial algorithm to compute shortest paths in weighted undirected graphs with no ne... See more
Technical Reports - DIT-02-006
ML systems: A Proof Theory for Contexts
2000, Note: Submitted to the Journal of Logic Language and Information, June 2002
Keywords: Contextual Reasoning, Distributed Information-Oriented Theories, Modal Logics, Multi Context systems, Normal Form, Proof Theory
Abstract: In the last decade the concept of context has been extensively exploited in many research areas, ... See more
Technical Reports - DIT-02-068
A Distributed Intelligenge Paradigm for Knowledge Management
2000, Note: Also in: "Proceedings of the AAAI'2000 Spring Symposium on Bringing Knowledge to Business Processes"
Keywords: knowledge management, agent-based architecture, case studies
Abstract: In the last ten years, knowledge management (KM) has become a new fashioned managerial practice. ... See more
Technical Reports - DIT-02-087
Minimum T-cuts and optimal T-pairings
Keywords: T-cut, minimum T-cut, T-pairing, Gomory-Hu tree.
Abstract: We introduce the notion of $T$-pairing and give a min-max characterization for the minimum size o... See more
Technical Reports - DIT-02-052
Indecomposable r-graphs and some other counterexamples
1999, Note: Published in: "Journal of Graph Theory" 32 (1) (1999) 1--15.
Keywords: r-graph; indecomposable; Petersen graph; Fulkerson Coloring
Abstract: An r-graph is any graph that can be obtained as a conic combination of its own 1-factors. An r-gr... See more
Technical Reports - DIT-02-040
EdgeÂColoring Bipartite Graphs
1999, Note: Published in Journal of Algorithms, 34 (2) (2000) 390-396
Abstract: Given a bipartite graph G with n nodes, m edges and maximum degree D, we find an edge coloring fo... See more