Ursula Martin

Q: What Schools Are Affiliated With Ursula Martin

Ursula Martin is affiliated with the following schools: University of Illinois Urbana-Champaign, Queen Mary University of London, University of Manchester, Royal Holloway, University of London, University of Cambridge, University of St Andrews, University of Warwick, University of Oxford

Ursula Martin's AcademicInfluence.com Rankings

Ursula Martin

Computer Science

#1905

World Rank

#1979

Historical Rank

Theoretical Computer Science

#50

World Rank

#50

Historical Rank

computer-science Degrees

Ursula Martin

Mathematics

#3742

World Rank

#5461

Historical Rank

Measure Theory

#4618

World Rank

#5406

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Why Is Ursula Martin Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Ursula Hilda Mary Martin is a British computer scientist, with research interests in theoretical computer science and formal methods. She is also known for her activities aimed at encouraging women in the fields of computing and mathematics. Since 2019, she has served as a professor at the School of Informatics, University of Edinburgh.

(See a Problem?)

Ursula Martin's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Boolean Unification - The Story So Far (1989) (104)
Ordered Rewriting and Confluence (1990) (74)
Automated theorem proving in support of computer algebra: symbolic definite integration as a case study (1999) (44)
How to Choose Weights in the Knuth Bendix Ordering (1987) (44)
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS (2001) (44)
Computers, Reasoning and Mathematical Practice (1999) (36)
A Geometrical Approach to Multiset Orderings (1989) (34)
Automating the Knuth Bendix ordering (1990) (31)
Seventy four minutes of mathematics: An analysis of the third Mini−Polymath project (2012) (31)
The order types of termination orderings on monadic terms, strings and multisets (1993) (30)
Mathematical practice, crowdsourcing, and social machines (2013) (28)
Lightweight formal methods for computer algebra systems (1998) (27)
The automorphism group of a finite p-group is almost always a p-group (2006) (26)
Almost all $p$-groups have automorphism group a $p$-group (1986) (26)
Slightly dirty maths: The richly textured mechanisms of impact (2017) (21)
A Hoare Logic for Single-Input Single-Output Continuous-Time Control Systems (2003) (21)
VSDITLU: a verifiable symbolic definite integral table look-up (1999) (17)
Stumbling Around in the Dark: Lessons from Everyday Mathematics (2015) (15)
Explanation in mathematical conversations: an empirical investigation (2019) (12)
Linear Interpretations by Counting Patterns (1993) (12)
What does mathoverflow tell us about the production of mathematics? (2013) (11)
Design Verification for Control Engineering (2004) (10)
The Lovelace–De Morgan mathematical correspondence: A critical re-appraisal (2017) (10)
Unification in Boolean rings (1986) (10)
On the Diversity of Orderings on Strings (1995) (10)
A Note on Division Orderings on Strings (1990) (9)
Automating Squiggol (1990) (9)
A Hoare logic for linear systems (2013) (9)
Hidden verification for computational mathematics (2005) (8)
Modelling the way mathematics is actually done (2017) (8)
Some Experiments with a Completion Theorem Prover (1992) (8)
Towards Mathematical AI via a Model of the Content and Process of Mathematical Question and Answer Dialogues (2017) (8)
Formal Methods for Extensions to CAS (1999) (8)
Reasoning about linear systems (2007) (7)
Extension Functions for Multiset Orderings (1987) (7)
Intelligent Computer Mathematics 10th International Conference, CICM 2017 (2017) (7)
A general framework for sound and complete Floyd-Hoare logics (2008) (7)
Hoare Logic in the Abstract (2006) (7)
The early mathematical education of Ada Lovelace (2017) (7)
Experiments with program verification systems (1989) (7)
Argumentation Theory for Mathematical Argument (2018) (6)
Theorem Proving in Higher Order Logics (2001) (6)
First International Workshop on Larch (1993) (6)
Rocket science or social science? Involving women in the creation of computing (2004) (6)
Computer algebra meets automated theorem proving: A maple−pvs interface (2001) (6)
Verification Techniques for LOTOS (1994) (5)
Doing algebra with REVE (1986) (5)
The occurrence of groups as automorphisms of nilpotentp−groups (1981) (5)
Using crowdsourced mathematics to understand mathematical practice (2020) (5)
Computational logic and the social (2016) (4)
The Classification of Polynomial Orderings on Monadic Terms (2001) (4)
Theorem Proving with Group Presentations: Examples and Questions (1996) (4)
Unification in Special P−groups (1989) (3)
Applications of real number theorem proving in PVS (2013) (3)
Bootstrapping the next generation of mathematical social machines (2017) (3)
Invariants, Patterns and Weights for Ordering Terms (2000) (3)
Journeys in Mathematical Landscapes: Genius or Craft? (2019) (3)
Ada Lovelace: The Making of a Computer Scientist (2018) (3)
Vsditlu: a Veriied Symbolic Deenite Integral Table Look-up (1999) (2)
An elementary proof of Gaschütz'theorem (1980) (2)
Opportunities and Challenges in 21st Century Experimental Mathematical Computation: ICERM Workshop Report (2014) (2)
Hardy, Littlewood and polymath (2015) (2)
Unification in Boolean Rings an Unquantified Formulae of First Order Predicate Calculus (1986) (2)
A maple−pvs interface (2001) (2)
Workshop: The Role of Automated Deduction in Mathematics (2000) (2)
Fifth IEEE International Conference on Software Engineering and Formal Methods (SEFM 2007), 10-14 September 2007, London, England, UK (2007) (1)
Enabling mathematical cultures: introduction (2021) (1)
Panelist position statement: logic and models in computer science (2005) (1)
Automorphisms of finitely generated nilpotent groups. (1978) (1)
1377 questions and counting–what can we learn from online math (2012) (1)
A General Framework for Sound and Complete (2008) (1)
First International Workshop on Larch, Proceedings of the first First International Workshop on Larch, Dedham, Massachusetts, USA, 13-15 July 1992 (1993) (1)
Steve Linton Lightweight formal methods for computer algebra systems In ISSAC98: Proc ACM International Symposium on Symbolic and Algebraic Computation‚ Rostock (1998) (1)
Case studies in equational reasoning (1990) (1)
Towards formal methods for mathematical modeling (2000) (1)
Opportunities and Challenges in 21st Century Mathematical Computation: ICERM Workshop Report (2014) (1)
Investigating some embedded verification techniques for computer algebra systems (1997) (1)
Automating "Human-Like" Example-Use in Mathematics (2018) (1)
New Directions for Syntactic Termination Orderings (1998) (1)
Ada Lovelace‚ mathematician (2015) (0)
Using graphs to investigate the automorphism groups of nilpotent groups (1985) (0)
Close Observation And Description (2014) (0)
Ada Lovelace, a scientist in the archives (2015) (0)
The early mathematical education of Ada (2017) (0)
Termination, Geometry and Invariants (1994) (0)
Logical structures for control 1 A SUMMARY (0)
The theory of termination orderings on strings: exposition and examples (1995) (0)
Veriication Techniques for Lotos (0)
The social machine of mathematics (0)
Women in Logic 2018 workshop report (2019) (0)
2017 International Workshop on Functional Art, Music, Modelling and Design (FARM 2017) (2017) (0)
Proceedings of the first First International Workshop on Larch (1992) (0)
Automated theorem proving in support of omputer algebra : symboli de niteintegration as a ase studyA (2007) (0)
The social machine of mathematics (0)
Algebra and Automated Deduction (1996) (0)
University of Dundee Automating " human-like " example-use in mathematics (2018) (0)
Logic and computationInteractive proof with Cambridge LCF: By LC Paulson. Cambridge University Press‚ Cambridge‚ 1987‚ Price£ 27.50‚ ISBN 0 521 34632 0 (1988) (0)
ADA Lovelace Computer Scientist (2015) (0)
PhilMath Intersem 2012 Complexities of Proof : Varieties , Effects & Management June 6 – June 26 , 2012 (0)
Computers‚ Reasoning and Mathematical (2012) (0)
Equational Reasoning in Groups (1990) (0)
The number of stem covers of an elementary abelianp−group (1983) (0)
A Hoare logic for linear systems (2011) (0)
Argumentation Theory for Mathematical Argument (2019) (0)
Applications of real number theorem proving in PVS (2012) (0)
Logic for computer science: By J.H. Gallier. Harper & Row, London, 1986, Price £17.95, ISBN 0 06 042225 4 (1988) (0)
Formal methods for Simulink: an assessment (2002) (0)
Outer automorphisms of some finitely generated nilpotent groups I (1980) (0)
An independence theorem for automorphisms of torsion−free groups (1981) (0)

This paper list is powered by the following services:

Other Resources About Ursula Martin

en.wikipedia.org

What Schools Are Affiliated With Ursula Martin?

Ursula Martin is affiliated with the following schools:

Ursula Martin's Academic­Influence.com Rankings

Why Is Ursula Martin Influential?

Ursula Martin's Published Works

Published Works

Other Resources About Ursula Martin

What Schools Are Affiliated With Ursula Martin?

Ursula Martin's AcademicInfluence.com Rankings