2009 - SIAM Fellow For contributions to the design of networks and circuits and for technology for Web content delivery.
2008 - Member of the National Academy of Sciences
2004 - Member of the National Academy of Engineering For contributions to the design of networks and circuits and for technology for Web content delivery.
2003 - Fellow of the American Academy of Arts and Sciences
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 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.
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.
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.
A Secure, Robust Watermark for Multimedia
Ingemar J. Cox;Joe Kilian;Frank Thomson Leighton;Talal Shamoon.
information hiding (1996)
A FRAMEWORK FOR SOLVING VLSI GRAPH LAYOUT PROBLEMS
S. N. Bhatt;F. T. Leighton.
Journal of Computer and System Sciences (1983)
Method and system for personal identification
Frank T Leighton;Silvio Micali;シルヴィオ、ミカーリ;フランク、ティー、リータン.
Packet routing and job-shop scheduling in O (congestion+dilation) steps
Frank Thomson Leighton;Bruce M. Maggs;Satish Rao.
Wafer-scale integration of systolic arrays
Frank Thomson Leighton;Charles E. Leiserson.
foundations of computer science (1982)
Embedding graphs in books: a layout problem with applications to VLSI design
F. R. K. Chung;F. T. Leighton;A. L. Rosenberg.
Siam Journal on Algebraic and Discrete Methods (1987)
Method for enabling users of a cryptosystem to generate and use a private pair key for enciphering communications between the users
Frank T. Leighton;Silvio Micali.
Method and system for personal identification using proofs of legitimacy
리이톤, 플랭크, 톰슨;실비오 미쉘리.
Method for authenticating objects identified by images or other identifying information
Frank T. Leighton;Silvio Micali.
New lower bound techniques for VLSI
Frank Thomson Leighton.
Theory of Computing Systems / Mathematical Systems Theory (1984)
If you think any of the details on this page are incorrect, let us know.
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: