X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
lower bounds (5) 5
communication complexity (4) 4
dynamic networks (4) 4
complexity (3) 3
computer science (3) 3
adaptive adversary (2) 2
computer science, theory & methods (2) 2
oblivious adversary (2) 2
unknown network diameter (2) 2
algorithms (1) 1
analysis (1) 1
bibliographic database (1) 1
bibliographical citations (1) 1
bitcoin (1) 1
boundary value problems (1) 1
computation (1) 1
computer networks (1) 1
computer science, hardware & architecture (1) 1
computer science, information systems (1) 1
computer science, software engineering (1) 1
congresses (1) 1
congresses and conventions (1) 1
distributed processing (1) 1
electronic data processing (1) 1
error probability (1) 1
evaluation (1) 1
link failures (1) 1
mathematical problems (1) 1
networks (1) 1
numerical analysis (1) 1
production scheduling (1) 1
protocols (1) 1
publication analysis (1) 1
ranking (1) 1
research (1) 1
social network (1) 1
time complexity (1) 1
upper bounds (1) 1
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


by Jahja, I and Yu, HF and Zhao, YD
DISTRIBUTED COMPUTING, ISSN 0178-2770, 02/2020, Volume 33, Issue 1, pp. 1 - 40
This paper considers several closely-related problems in synchronous dynamic networks with oblivious adversaries, and proves novel O(d + poly(m)) lower bounds... 
Lower bounds | Adaptive adversary | Communication complexity | COMPUTER SCIENCE, THEORY & METHODS | Dynamic networks | Oblivious adversary | Production scheduling | Complexity
Journal Article
Journal of the ACM (JACM), ISSN 0004-5411, 09/2018, Volume 65, Issue 5, pp. 1 - 34
Journal Article
Association for Computing Machinery. Journal of the Association for Computing Machinery, ISSN 0004-5411, 09/2018, Volume 65, Issue 5
For dynamic networks with unknown diameter, we prove novel lower bounds on the time complexity of a range of basic distributed computing problems. Together... 
Mathematical problems | Lower bounds | Networks | Distributed processing | Boundary value problems | Numerical analysis | Upper bounds | Computer networks | Complexity
Journal Article
Leibniz International Proceedings in Informatics, LIPIcs, ISSN 1868-8969, 10/2017, Volume 91
Conference Proceeding
IEEE INFOCOM 2018 - IEEE Conference on Computer Communications, ISSN 0743-166X, 04/2018, Volume 2018-, pp. 2528 - 2536
In a sybil attack, an adversary creates a large number of fake identities/nodes and have them join the system. Computational puzzles have long been... 
Computer science | Protocols | Error probability | Time complexity | Bitcoin
Conference Proceeding
Proceedings of the 28th ACM Symposium on parallelism in algorithms and architectures, 07/2016, Volume 11-13-, pp. 405 - 416
For dynamic networks with unknown diameter , we prove novel lower bounds on the time complexity of a range of basic distributed computing problems. Together... 
unknown network diameter | communication complexity | lower bounds | dynamic networks | Lower bounds | Communication complexity | Dynamic networks | Unknown network diameter
Conference Proceeding
D-Lib Magazine, 2014, Volume 20, Issue 11-12
Journal Article
Proceedings of the 23rd International Conference on world wide web, 04/2014, pp. 1215 - 1220
A large percentage of the research in computer science is published in conferences and workshops. We propose three methods which compute a "relatedness score"... 
social network | publication analysis | bibliographic database | ranking | Social network | Ranking | Bibliographic database | Publication analysis
Conference Proceeding
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.