D-Index & Metrics Best Publications

D-Index & Metrics

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 35 Citations 5,778 113 World Ranking 5801 National Ranking 2810

Overview

What is he best known for?

The fields of study he is best known for:

  • Programming language
  • Algebra
  • Mathematical logic

His primary areas of investigation include Theoretical computer science, Cryptographic protocol, Lambda calculus, Algebra and Probabilistic logic. Andre Scedrov has included themes like Cryptography, Cryptographic nonce, Protocol analysis, Notation and Existential quantification in his Theoretical computer science study. His Lambda calculus research incorporates themes from Commutative property and Parametric polymorphism.

His work is dedicated to discovering how Commutative property, Intuitionistic logic are connected with Linear logic and other disciplines. His Algebra study combines topics in areas such as Zeroth-order logic and Autoepistemic logic. His Probabilistic logic research focuses on subjects like Process calculus, which are linked to Calculus and Time complexity.

His most cited work include:

  • Uniform proofs as a foundation for logic programming (554 citations)
  • A meta-notation for protocol analysis (243 citations)
  • A probabilistic poly-time framework for protocol analysis (210 citations)

What are the main themes of his work throughout his whole career to date?

Andre Scedrov mainly investigates Theoretical computer science, Computer security, Discrete mathematics, Cryptographic protocol and Linear logic. His Theoretical computer science study combines topics from a wide range of disciplines, such as Rewriting, Probabilistic logic and Cryptography. His Probabilistic logic research integrates issues from Equivalence and Observational equivalence.

His study looks at the relationship between Cryptography and topics such as Encryption, which overlap with Soundness. His Computer security research focuses on Protocol and how it connects with Adversary. His Linear logic study is concerned with Algebra in general.

He most often published in these fields:

  • Theoretical computer science (31.58%)
  • Computer security (15.79%)
  • Discrete mathematics (15.79%)

What were the highlights of his more recent work (between 2016-2021)?

  • Calculus (17.70%)
  • Decidability (11.48%)
  • Cryptographic protocol (17.70%)

In recent papers he was focusing on the following fields of study:

His main research concerns Calculus, Decidability, Cryptographic protocol, Theoretical computer science and Categorial grammar. His biological study spans a wide range of topics, including Bracket and Conjunction. Andre Scedrov combines subjects such as Commutative property, Proof theory, Cryptography, Linear logic and Extension with his study of Decidability.

Cryptographic protocol is a subfield of Computer security that Andre Scedrov studies. His Theoretical computer science research is multidisciplinary, relying on both Security analysis and Gas meter prover. His Rewriting study necessitates a more in-depth grasp of Programming language.

Between 2016 and 2021, his most popular works were:

  • Subexponentials in non-commutative linear logic (44 citations)
  • Automated Analysis of Cryptographic Assumptions in Generic Group Models (32 citations)
  • A Rewriting Framework and Logic for Activities Subject to Regulations (12 citations)

In his most recent research, the most cited papers focused on:

  • Programming language
  • Algebra
  • Algorithm

Decidability, Rewriting, Linear logic, Calculus and Theoretical computer science are his primary areas of study. The concepts of his Decidability study are interwoven with issues in Structure, Fragment, Homomorphism and Completeness. The Rewriting study combines topics in areas such as Cryptographic protocol, Reachability problem, Access control, Probabilistic logic and Algorithm.

His studies deal with areas such as Commutative property, Programming language, Proof theory and Contraction as well as Linear logic. His research integrates issues of Bracket, Formalism, Extension, Syntax and Natural language in his study of Calculus. The various areas that Andre Scedrov examines in his Theoretical computer science study include Computational complexity theory and Probabilistic analysis of algorithms.

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.

Best Publications

Uniform proofs as a foundation for logic programming

D. Miller;G. Nadathur;F. Pfenning;A. Scedrov.
Annals of Pure and Applied Logic (1991)

860 Citations

A meta-notation for protocol analysis

I. Cervesato;N.A. Durgin;P.D. Lincoln;J.C. Mitchell.
ieee computer security foundations symposium (1999)

368 Citations

Decision problems for propositional linear logic

Patrick Lincoln;Patrick Lincoln;John C. Mitchell;Andre Scedrov;Natarajan Shankar.
Annals of Pure and Applied Logic (1992)

353 Citations

Inheritance as implicit coercion

Val Breazu-Tannen;Thierry Coquand;Carl A. Gunter;Andre Scedrov.
Information & Computation (1991)

341 Citations

Bounded linear logic: a modular approach to polynomial-time computability

Jean-Yves Girard;Andre Scedrov;Philip J. Scott.
Theoretical Computer Science (1992)

332 Citations

Inheritance and explicit coercion

V. Breazu-Tannen;T. Coquand;C.A. Gunter;A. Scedrov.
logic in computer science (1989)

309 Citations

A probabilistic poly-time framework for protocol analysis

P. Lincoln;J. Mitchell;M. Mitchell;A. Scedrov.
computer and communications security (1998)

275 Citations

Functorial polymorphism

E. S. Bainbridge;P. J. Freyd;A. Scedrov;P. J. Scott.
Theoretical Computer Science - Special issue: Fourth workshop on mathematical foundations of programming semantics, Boulder, CO, May 1988 archive (1990)

223 Citations

Multiset rewriting and the complexity of bounded security protocols

Nancy Durgin;Patrick Lincoln;John Mitchell;Andre Scedrov.
Journal of Computer Security (2004)

216 Citations

An Extension of System F with Subtyping

Luca Cardelli;Simone Martini;John C. Mitchell;Andre Scedrov.
international conference on theoretical aspects of computer software (1991)

172 Citations

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

Contact us

Best Scientists Citing Andre Scedrov

Dale Miller

Dale Miller

French Institute for Research in Computer Science and Automation - INRIA

Publications: 84

Frank Pfenning

Frank Pfenning

Carnegie Mellon University

Publications: 63

Martín Abadi

Martín Abadi

University of California, Santa Cruz

Publications: 46

John C. Mitchell

John C. Mitchell

Stanford University

Publications: 41

Birgit Pfitzmann

Birgit Pfitzmann

IBM (United States)

Publications: 33

Benjamin C. Pierce

Benjamin C. Pierce

University of Pennsylvania

Publications: 29

Anupam Datta

Anupam Datta

Carnegie Mellon University

Publications: 25

Bruno Blanchet

Bruno Blanchet

French Institute for Research in Computer Science and Automation - INRIA

Publications: 25

Michael Waidner

Michael Waidner

TU Darmstadt

Publications: 22

Luca Cardelli

Luca Cardelli

University of Oxford

Publications: 21

Joshua Guttman

Joshua Guttman

Worcester Polytechnic Institute

Publications: 20

Ran Canetti

Ran Canetti

Boston University

Publications: 20

Cédric Fournet

Cédric Fournet

Microsoft (United States)

Publications: 19

Catherine Meadows

Catherine Meadows

United States Naval Research Laboratory

Publications: 18

Martin Hofmann

Martin Hofmann

Ludwig-Maximilians-Universität München

Publications: 17

Philip Wadler

Philip Wadler

University of Edinburgh

Publications: 17

Trending Scientists

A.P.S. Selvadurai

A.P.S. Selvadurai

McGill University

Ni-Bin Chang

Ni-Bin Chang

University of Central Florida

Guillaume Morin

Guillaume Morin

Université Paris Cité

Antoine Aboukaïs

Antoine Aboukaïs

University of the Littoral Opal Coast

Guangji Wang

Guangji Wang

China Pharmaceutical University

Sei Kwang Hahn

Sei Kwang Hahn

Pohang University of Science and Technology

Karl Eduard Linsenmair

Karl Eduard Linsenmair

University of Würzburg

Stephen D. Cairns

Stephen D. Cairns

National Museum of Natural History

Eva K. Wollenberg

Eva K. Wollenberg

University of Vermont

Merton Bernfield

Merton Bernfield

Harvard University

Peter J. Christie

Peter J. Christie

The University of Texas at Austin

Erez Raz

Erez Raz

University of Münster

Gary A. Silverman

Gary A. Silverman

Washington University in St. Louis

Arlette Darfeuille-Michaud

Arlette Darfeuille-Michaud

University of Clermont Auvergne

Siyan Ma

Siyan Ma

University of California, Berkeley

Hildy S. Ross

Hildy S. Ross

University of Waterloo

Something went wrong. Please try again later.