Gregory B. Sorkin spends much of his time researching Computer virus, Combinatorics, IBM, Artificial neural network and Optimization problem. In his study, which falls under the umbrella issue of Computer virus, Trojan and Internet privacy is strongly linked to Host. His study in the field of Random graph and Time complexity is also linked to topics like Metropolis–Hastings algorithm, High probability and Graph bisection.
The study incorporates disciplines such as Data mining, Classifier, Data, Data file and Byte in addition to Artificial neural network. His biological study spans a wide range of topics, including Almost surely, Structure, Combinatorial optimization and Constant. His studies deal with areas such as Linear programming, Maximum cut, Proof theory and Approximation algorithm as well as Combinatorial optimization.
Gregory B. Sorkin mainly investigates Combinatorics, Discrete mathematics, Algorithm, Random graph and Maximum cut. The concepts of his Combinatorics study are interwoven with issues in Satisfiability and Exponential distribution. His Discrete mathematics research is multidisciplinary, relying on both Random assignment, Graph, Degree and Matching.
His work on Reduction is typically connected to PSPACE as part of general Algorithm study, connecting several disciplines of science. Gregory B. Sorkin has included themes like Ising model, Expected value, Linear programming, Optimization problem and Cubic graph in his Maximum cut study. His research in Optimization problem intersects with topics in Simulated annealing, Approximation algorithm and Combinatorial optimization.
His main research concerns Combinatorics, Complete graph, Exponential distribution, Discrete mathematics and Minimum weight. His Combinatorics research incorporates themes from Mixing, Ising model and Constant. His Complete graph research includes elements of Edge and Random graph.
His research investigates the connection with Random graph and areas like Spanning tree which intersect with concerns in Conjecture. Gregory B. Sorkin has researched Discrete mathematics in several fields, including Random assignment and Scaling. His Vertex research integrates issues from Maximum cut, Algorithm and Cubic graph.
His primary scientific interests are in Combinatorics, Discrete mathematics, Theoretical computer science, Algorithm and Hypergraph. His studies in Combinatorics integrate themes in fields like Type, Mixing and Potts model. His Discrete mathematics study integrates concerns from other disciplines, such as Efficient algorithm, Random assignment, Scaling and Matching.
His Theoretical computer science research incorporates elements of Algorithm design and Measure and conquer. His study in the field of Online algorithm, Binary tree, Treap and Optimal binary search tree also crosses realms of Tree diagram. His work carried out in the field of Hypergraph brings together such families of science as Satisfiability, Random systems and Variable.
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.
Gadgets, Approximation, and Linear Programming
Luca Trevisan;Gregory B. Sorkin;Madhu Sudan;David P. Williamson.
SIAM Journal on Computing (2000)
Neural networks for computer virus recognition
G.J. Tesauro;J.O. Kephart;G.B. Sorkin.
IEEE Intelligent Systems (1996)
System and method for protecting integrity of alterable ROM using digital signatures
David M. Chess;Gregory Bret Sorkin;Steve Richard White.
Biologically inspired defenses against computer viruses
Jeffrey O. Kephart;Gregory B. Sorkin;William C. Arnold;David M. Chess.
international joint conference on artificial intelligence (1995)
Automatic analysis of a computer virus structure and means of attachment to its hosts
David M. Chess;Jeffrey O. Kephart;Gregory B. Sorkin.
Adaptive statistical regression and classification of data strings, with application to the generic detection of computer viruses
Jeffrey Owen Kephart;Gregory Bret Sorkin;Gerald James Tesauro;Steven Richard White.
Fighting Computer Viruses
Jeffrey O. Kephart;Gregory B. Sorkin;David M. Chess;Steve R. White.
Scientific American (1997)
The metropolis algorithm for graph bisection
Mark Jerrum;Gregory B. Sorkin.
Discrete Applied Mathematics (1998)
Applying harmonic balance to almost-periodic circuits
K.S. Kundert;G.B. Sorkin;A. Sangiovanni-Vincentelli.
IEEE Transactions on Microwave Theory and Techniques (1988)
Blueprint for a Computer Immune System
Jeffrey O. Kephart;Gregory B. Sorkin;Morton Swimmer;Steve R. White.
Proceedings of the 1997 International Virus Bulletin Conference, San Francisco, California, October, 1997 (1999)
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: