The scientist’s investigation covers issues in Computer network, Distributed computing, Spanning tree, Theoretical computer science and Distributed algorithm. His work on Communications system, Base station identity code, Network packet and Authentication as part of general Computer network research is frequently linked to Network Access Control, bridging the gap between disciplines. In his study, Asynchronous network, Shared memory, Unique identifier and Communication channel is inextricably linked to Protocol, which falls within the broad field of Distributed computing.
He combines subjects such as Algorithm and Computation with his study of Spanning tree. His Theoretical computer science research includes elements of Network topology, Verifiable secret sharing, Self-stabilization, Adaptation and Key distribution. His work carried out in the field of Distributed algorithm brings together such families of science as Time complexity, Graph, Combinatorics and Distributed minimum spanning tree.
Shay Kutten focuses on Theoretical computer science, Distributed computing, Computer network, Distributed algorithm and Algorithm. His Theoretical computer science study incorporates themes from Network topology and Asynchronous communication. His Distributed computing research is multidisciplinary, relying on both Telecommunications network, Node and Protocol.
His research integrates issues of Time complexity, Combinatorics, Spanning tree and Upper and lower bounds in his study of Distributed algorithm. The Time complexity study combines topics in areas such as Current, Randomized algorithm, Graph and Communication complexity. His work deals with themes such as Asynchrony and Degree, which intersect with Algorithm.
Shay Kutten mostly deals with Theoretical computer science, Combinatorics, Time complexity, Deterministic algorithm and Graph. Shay Kutten focuses mostly in the field of Theoretical computer science, narrowing it down to topics relating to Network planning and design and, in certain cases, Steiner tree problem. His Time complexity study which covers Distributed algorithm that intersects with Asynchronous communication.
His Deterministic algorithm research incorporates themes from Binary logarithm, Randomized algorithm and Leader election. The concepts of his Upper and lower bounds study are interwoven with issues in Computer network and Spanning tree. His work in the fields of Computer network, such as Bandwidth, intersects with other areas such as Transformation.
Deterministic algorithm, Combinatorics, Leader election, Upper and lower bounds and Graph are his primary areas of study. As part of the same scientific family, Shay Kutten usually focuses on Deterministic algorithm, concentrating on Vertex cover and intersecting with Randomized algorithm. The Matroid and Disjoint sets research Shay Kutten does as part of his general Combinatorics study is frequently linked to other disciplines of science, such as Set theory and Extension, therefore creating a link between diverse domains of science.
To a larger extent, Shay Kutten studies Theoretical computer science with the aim of understanding Leader election. His research brings together the fields of Enhanced Data Rates for GSM Evolution and Theoretical computer science. In his study, Routing is strongly linked to Network planning and design, which falls under the umbrella field of Graph.
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.
Perfectly-Secure Key Distribution for Dynamic Conferences
Carlo Blundo;Alfredo De Santis;Amir Herzberg;Shay Kutten.
international cryptology conference (1992)
Perfectly-Secure Key Distribution for Dynamic Conferences
Carlo Blundo;Alfredo De Santis;Amir Herzberg;Shay Kutten.
international cryptology conference (1992)
On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
I. Chlamtac;S. Kutten.
IEEE Transactions on Communications (1985)
On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
I. Chlamtac;S. Kutten.
IEEE Transactions on Communications (1985)
Method and system for the secured distribution of multimedia titles
Amir Herzberg;Hugo Mario Krawczyk;Shay Kutten;An Van Le.
(1997)
Method and system for the secured distribution of multimedia titles
Amir Herzberg;Hugo Mario Krawczyk;Shay Kutten;An Van Le.
(1997)
Fast Distributed Construction of Smallk-Dominating Sets and Applications
Shay Kutten;David Peleg.
Journal of Algorithms (1998)
Fast Distributed Construction of Smallk-Dominating Sets and Applications
Shay Kutten;David Peleg.
Journal of Algorithms (1998)
Perfectly secure key distribution for dynamic conferences
Carlo Blundo;Alfredo De Santis;Ugo Vaccaro;Amir Herzberg.
Information & Computation (1998)
Perfectly secure key distribution for dynamic conferences
Carlo Blundo;Alfredo De Santis;Ugo Vaccaro;Amir Herzberg.
Information & Computation (1998)
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:
Weizmann Institute of Science
University of Connecticut
VMware
Tel Aviv University
Algorand Foundation
Johns Hopkins University
Tel Aviv University
University of Houston
IBM (United States)
Columbia University
Rovira i Virgili University
University of Rostock
Microsoft (United States)
University of Queensland
Temple University
University of Oslo
Swiss Federal Laboratories for Materials Science and Technology
Institut Pasteur
National Jewish Health
Michigan State University
Case Western Reserve University
INRAE : Institut national de recherche pour l'agriculture, l'alimentation et l'environnement
University of the Republic
Experimental Medicine and Biology Institute
University of Cambridge
National Yang Ming Chiao Tung University