- Home
- Best Scientists - Computer Science
- Ugo Montanari

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
62
Citations
14,644
297
World Ranking
1327
National Ranking
22

1991 - Member of Academia Europaea

- Programming language
- Algebra
- Artificial intelligence

His primary scientific interests are in Theoretical computer science, Concurrency, Discrete mathematics, Algebra and Petri net. Ugo Montanari has included themes like Operational semantics, Denotational semantics, Graph rewriting and Computation in his Theoretical computer science study. His research on Concurrency concerns the broader Programming language.

His Discrete mathematics research includes elements of Rewriting, Axiom and Algebraic number. Ugo Montanari interconnects Algebraic graph theory, Logic programming, Graph algebra and Combinatorics in the investigation of issues within Algebra. The Petri net study combines topics in areas such as Primitive notion, Security token, Rule of inference, Transition system and Calculus of communicating systems.

- An Efficient Unification Algorithm (695 citations)
- Semiring-based constraint satisfaction and optimization (611 citations)
- Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach (437 citations)

Ugo Montanari focuses on Theoretical computer science, Programming language, Discrete mathematics, Algebra and Petri net. His work deals with themes such as Rewriting, Operational semantics, Graph rewriting and Constraint programming, which intersect with Theoretical computer science. In his research on the topic of Graph rewriting, L-attributed grammar is strongly related with Tree-adjoining grammar.

His work on Constraint satisfaction expands to the thematically related Programming language. His work carried out in the field of Discrete mathematics brings together such families of science as Axiom and Transition system. As part of his studies on Algebra, he often connects relevant areas like Coalgebra.

- Theoretical computer science (32.22%)
- Programming language (25.11%)
- Discrete mathematics (20.44%)

- Theoretical computer science (32.22%)
- Programming language (25.11%)
- Distributed computing (10.44%)

The scientist’s investigation covers issues in Theoretical computer science, Programming language, Distributed computing, Semantics and Algebra. His studies in Theoretical computer science integrate themes in fields like Representation, Graph rewriting and Petri net. His Programming language research is multidisciplinary, incorporating elements of Constraint satisfaction and Mathematical proof.

The study incorporates disciplines such as Semantics and Algorithm in addition to Semantics. His Algebra research incorporates themes from Discrete mathematics, Theory of computation and Coalgebra. His study in Discrete mathematics is interdisciplinary in nature, drawing from both Reactive system and Axiom.

- Open bisimulation for the concurrent constraint pi-calculus (39 citations)
- Style-Based Architectural Reconfigurations (39 citations)
- A connector algebra for P/T nets interactions (38 citations)

- Programming language
- Algebra
- Algorithm

Theoretical computer science, Semantics, Programming language, Process calculus and Algebra are his primary areas of study. His Theoretical computer science research includes themes of Rewriting, Software and Petri net. He has researched Petri net in several fields, including Discrete mathematics and Dual polyhedron.

His Programming language research is multidisciplinary, relying on both Constraint satisfaction, Constraint programming and Constraint logic programming. The concepts of his Process calculus study are interwoven with issues in Network architecture, Graph rewriting, Transition system and Software-defined networking. His Algebra study integrates concerns from other disciplines, such as Bigraph and Coalgebra.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

An Efficient Unification Algorithm

Alberto Martelli;Ugo Montanari.

ACM Transactions on Programming Languages and Systems **(1982)**

1332 Citations

Semiring-based constraint satisfaction and optimization

Stefano Bistarelli;Ugo Montanari;Francesca Rossi.

Journal of the ACM **(1997)**

912 Citations

Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach

A. Corradini;U. Montanari;F. Rossi;H. Ehrig.

Handbook of graph grammars and computing by graph transformation **(1997)**

695 Citations

Petri nets are moniods

José Meseguer;Ugo Montanari.

Information & Computation **(1990)**

531 Citations

On the optimal detection of curves in noisy pictures

Ugo Montanari.

Communications of The ACM **(1971)**

434 Citations

Semiring-Based CSPs and Valued CSPs: Frameworks, Properties,and Comparison

S. Bistarelli;U. Montanari;F. Rossi;T. Schiex.

Constraints - An International Journal **(1999)**

419 Citations

A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance

U. Montanari.

Journal of the ACM **(1968)**

351 Citations

Semiring-based constraint solving and optimization

Stefano Bistarelli;Ugo Montanari;Francesca Rossi.

Journal of the ACM **(1997)**

345 Citations

Graph processes

A. Corradini;U. Montanari;F. Rossi.

Fundamenta Informaticae **(1996)**

310 Citations

Contextual nets

Ugo Montanari;Francesca Rossi.

Acta Informatica archive **(1995)**

283 Citations

IBM (United States)

University of Southampton

University of Illinois at Urbana-Champaign

Technical University of Berlin

IMT Institute for Advanced Studies Lucca

University of Parma

Fondazione Bruno Kessler

Institute of Information Science and Technologies

Leiden University

University of Bologna

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.