Author:
Bazzi Rida A.,Konjevod Goran
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference22 articles.
1. Agarwal N., Basch J., Beckmann P., Bharti P., Bloebaum S., Casadei S., Chou A., Enge P., Fong W., Hathi N., Mann W., Sahai A., Stone J., Tsitsiklis J., Roy B.V. (2002) Algorithms for GPS operation indoors and downtown. GPS Solut. 6, 149–160
2. Amaldi E., Kann V. (1995) The complexity and approximability of finding maximum feasible subsets of linear relations. Theoret. Comput. Sci. 147, 181–210
3. Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. In: Approximation Algorithms for NP-hard Problems, pp. 396–345. PWS (1997)
4. Blumenthal L. (1953) Theory and Applications of Distance Geometry. Clarendon Press, Oxford
5. Brönnimann, H.: Derandomization of geometric algorithms. Ph.D. thesis, Princeton University (1995)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Web3 Sybil avoidance using network latency;Computer Networks;2023-05
2. Web3 Sybil Avoidance Using Network Latency;SSRN Electronic Journal;2022
3. Trust and reputation for Internet of Things: Fundamentals, taxonomy, and open research challenges;Journal of Network and Computer Applications;2019-11
4. Towards Securing Peer-to-Peer SIP in the MANET Context: Existing Work and Perspectives;2017 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData);2017-06
5. Towards Secure Distributed Hash Table;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2016