Amanote Research
Register
Sign In
Concurrent Counting Is Harder Than Queuing
doi 10.1109/ipdps.2006.1639327
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2006
Authors
S. Tirthapura
C. Busch
Publisher
IEEE
Related search
Finding a Heaviest Vertex-Weighted Triangle Is Not Harder Than Matrix Multiplication
SIAM Journal on Computing
Mathematics
Computer Science
Concurrent Traffic Queuing Game in Smart Home
Computer Simulation of Phase Decomposition Process Generating Precipitates Harder Than Matrix
Materials Transactions, JIM
Open Science: Data Sharing Is Harder to Reward
Nature
Multidisciplinary
Evaluation of Common Counting Method for Concurrent Data Mining Queries
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Counting Documents That Contain Substrings More Than K Times.
Journal of Natural Language Processing
Editorial: Information Sharing—Easy to Say … Much Harder to Do Than We Want to Believe!
Public Money and Management
Management
Business
Public Administration
Sociology
Political Science
Accounting
Work Harder, Not Smarter
Journal of Thoracic and Cardiovascular Surgery
Respiratory Medicine
Pulmonary
Cardiovascular Medicine
Surgery
Cardiology
Queuing Time and Utilization Ratio in Markov Queuing Systems
EasternEuropean Journal of Enterprise Technologies
Control
Electronic Engineering
Industrial
Mechanical Engineering
Energy Engineering
Applied Mathematics
Systems Engineering
Manufacturing Engineering
Computer Science Applications
Electrical
Innovation
Management of Technology
Power Technology