Mabry Tyson

dblp:07/3422 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorSecurity and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Software-defined and programmable networks · 100%
Theoretical computer science
3 papers
Automata and formal languages · 46% Algorithms and data structures · 15% Graph algorithms and graph theory · 15%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
SDN security
0.212013
FRESCO: Modular Composable Security Services for Software-Defined Networks · NDSS 2013
Automata and formal languages › transducers
finite-state transducers
0.011993
FASTUS: A Finite-state Processor for Information Extraction from Real-world Text · IJCAI 1993
Graph algorithms and graph theory › graph algorithms › graph search
depth-first search
0.011985
An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction · IJCAI 1985
Algorithms and data structures
search algorithms
0.011985
An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction · IJCAI 1985
Logic in computer science › proof theory
natural deduction
0.011982
Proof Methods in an Agenda-Based Natural-Deduction Theorem Prover · AAAI 1982
Automated reasoning and model checking
theorem proving
0.011982
Proof Methods in an Agenda-Based Natural-Deduction Theorem Prover · AAAI 1982
Automated reasoning and model checking
automated theorem proving
0.011985
An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction · IJCAI 1985

Methods — techniques the papers use, named apart from their topics

software-defined networking · 0.2consecutively bounded depth-first search · 0.0agenda-based theorem proving · 0.0
YearPublicationVenuePosition
2013 FRESCO: Modular Composable Security Services for Software-Defined Networks
Seungwon Shin 0001, Phillip A. Porras, Vinod Yegneswaran, Martin W. Fong, Guofei Gu, Mabry Tyson
NDSS6
1993 FASTUS: A Finite-state Processor for Information Extraction from Real-world Text
Douglas E. Appelt, Jerry R. Hobbs, John Bear, David J. Israel, Mabry Tyson
IJCAI5
1985 An Analysis of Consecutively Bounded Depth-First Search with Applications in Automated Deduction
Mark E. Stickel, Mabry Tyson
IJCAI2
1982 Proof Methods in an Agenda-Based Natural-Deduction Theorem Prover
Mabry Tyson
AAAI1