What is he best known for?
The fields of study he is best known for:
- Computer network
- Operating system
- Algorithm
Frank Thomson Leighton mainly focuses on Computer security, Public-key cryptography, Terminal, Discrete mathematics and Upper and lower bounds.
His study in Public-key cryptography is interdisciplinary in nature, drawing from both Card reader, Microcomputer and Cryptography.
Terminal is connected with One-time password, Identification and Password in his research.
His One-time password study combines topics in areas such as Cryptosystem, Encryption and Computer hardware.
His Discrete mathematics study focuses mostly on Graph embedding, Line graph, Book embedding, Complement graph and Topological graph theory.
The Upper and lower bounds study combines topics in areas such as Variety, Enhanced Data Rates for GSM Evolution, Theory of computation and Crossing number.
His most cited work include:
- A Secure, Robust Watermark for Multimedia (425 citations)
- A FRAMEWORK FOR SOLVING VLSI GRAPH LAYOUT PROBLEMS (401 citations)
- Method and system for personal identification (322 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Combinatorics, Discrete mathematics, Algorithm, Routing and Theoretical computer science.
His Discrete mathematics study combines topics from a wide range of disciplines, such as Embedding and Bounded function.
His Algorithm research is multidisciplinary, relying on both Path, Upper and lower bounds and Graph.
Frank Thomson Leighton combines subjects such as Crossing number and Integrated circuit with his study of Upper and lower bounds.
His Routing research integrates issues from Fault tolerance, Approximation algorithm and Rounding.
His work blends Theoretical computer science and Graph Layout studies together.
He most often published in these fields:
- Combinatorics (23.91%)
- Discrete mathematics (22.83%)
- Algorithm (21.74%)
What were the highlights of his more recent work (between 1994-2007)?
- Combinatorics (23.91%)
- Discrete mathematics (22.83%)
- Computer security (10.87%)
In recent papers he was focusing on the following fields of study:
Combinatorics, Discrete mathematics, Computer security, Algorithm and Ring are his primary areas of study.
Frank Thomson Leighton merges Combinatorics with Omega in his research.
His work on Hypercube, Hypercube graph and Graph product as part of general Discrete mathematics research is often related to Work, thus linking different fields of science.
His work on Key escrow, Public key cryptosystem, Security properties and Cryptosystem as part of general Computer security study is frequently linked to Popular press, bridging the gap between disciplines.
His Algorithm research incorporates elements of Load balancing and Security token.
The concepts of his Graph study are interwoven with issues in Graph theory, Clique-width, Graph bandwidth and Book embedding.
Between 1994 and 2007, his most popular works were:
- A Secure, Robust Watermark for Multimedia (425 citations)
- Complexity Issues in VLSI: Optimal Layouts for the Shuffle-Exchange Graph and Other Networks (113 citations)
- Resistance of digital watermarks to collusive attacks (89 citations)
In his most recent research, the most cited papers focused on:
- Computer network
- Operating system
- Algorithm
His primary areas of study are Digital watermarking, Watermark, Graph, Workstation and Scheduling.
His studies in Digital watermarking integrate themes in fields like Image processing, Digital content and Computer security, Cryptography.
His Watermark research is multidisciplinary, incorporating perspectives in Signal, Copy protection, Rotation and Degradation.
His Graph research includes themes of Graph bandwidth, Planar graph, Graph theory, Book embedding and Crossing number.
The study incorporates disciplines such as Supercomputer and Concurrent computing in addition to Workstation.
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.
