What is he best known for?
The fields of study he is best known for:
- Operating system
- Programming language
- Computer network
His scientific interests lie mostly in Distributed computing, Computer network, Data mining, Tree and Server.
The study incorporates disciplines such as Multiprocessor scheduling, Two-level scheduling, Parallel computing, Earliest deadline first scheduling and Bandwidth in addition to Distributed computing.
In his study, Data striping is inextricably linked to Component, which falls within the broad field of Bandwidth.
His work on Local area network and Service as part of his general Computer network study is frequently connected to Waiting time and Processor sharing queue, thereby bridging the divide between different branches of science.
His work in the fields of Data mining, such as Data stream mining, overlaps with other areas such as Data stream.
Richard R. Muntz has researched Server in several fields, including Piggybacking, Multimedia, Reliability and Type of service.
His most cited work include:
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (2122 citations)
- STING: A Statistical Information Grid Approach to Spatial Data Mining (1036 citations)
- A Probabilistic Room Location Service for Wireless Networked Environments (476 citations)
What are the main themes of his work throughout his whole career to date?
Distributed computing, Data mining, Computer network, Server and Queueing theory are his primary areas of study.
His research on Distributed computing focuses in particular on Distributed database.
His Data mining research is multidisciplinary, incorporating elements of Tree and Set.
Richard R. Muntz usually deals with Queueing theory and limits it to topics linked to Mathematical optimization and Markov model.
His Parallel computing research includes themes of Multiprocessor scheduling, Rate-monotonic scheduling, Dynamic priority scheduling, Fixed-priority pre-emptive scheduling and Fair-share scheduling.
In his research on the topic of Frequent subtree mining, Database is strongly related with Theoretical computer science.
He most often published in these fields:
- Distributed computing (20.25%)
- Data mining (17.72%)
- Computer network (11.39%)
What were the highlights of his more recent work (between 2000-2010)?
- Data mining (17.72%)
- Tree (6.33%)
- Tree structure (4.43%)
In recent papers he was focusing on the following fields of study:
His main research concerns Data mining, Tree, Tree structure, Theoretical computer science and Distributed computing.
His Data mining study combines topics from a wide range of disciplines, such as Probabilistic logic and Set.
His Tree structure research incorporates themes from Frequent subtree mining and Search tree.
His Theoretical computer science study incorporates themes from Class, Algorithm design, Computational complexity theory and Adaptive system.
His research integrates issues of Routing table, Scalability and Computer network, Server in his study of Distributed computing.
His studies deal with areas such as Ubiquitous computing and Data cluster as well as Computer network.
Between 2000 and 2010, his most popular works were:
- A Probabilistic Room Location Service for Wireless Networked Environments (476 citations)
- Moment: maintaining closed frequent itemsets over a stream sliding window (278 citations)
- Frequent Subtree Mining - An Overview (261 citations)
In his most recent research, the most cited papers focused on:
- Operating system
- Programming language
- Computer network
Data mining, Tree, Frequent subtree mining, Tree structure and Theoretical computer science are his primary areas of study.
His research in Data mining is mostly concerned with Data stream mining.
His study looks at the relationship between Data stream mining and topics such as Molecule mining, which overlap with XML.
Tree combines with fields such as Data stream and Boundary in his research.
His biological study spans a wide range of topics, including Scalability, Canonical form and Distributed database.
His work deals with themes such as Combinatorial explosion, Database and Link/cut tree, which intersect with Tree rotation.
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.
