From post

Frequency assignment in mobile and radio networks.

, , , и . Networks in Distributed Computing, том 45 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 73-90. DIMACS/AMS, (1997)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

How Hard Is It to Detect Surveillance? A Formal Study of Panopticons and Their Detectability Problem., , , и . Cryptogr., 6 (3): 42 (2022)Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies., , , и . J. Discrete Algorithms, 4 (3): 433-454 (2006)On the structure of equilibria in basic network formation., , , и . Theor. Comput. Sci., (2015)On the robustness of interconnections in random graphs: a symbolic approach., , , и . Theor. Comput. Sci., 287 (2): 515-534 (2002)The Perfect and Imperfect Clocks Approach to Performance Analysis of Basic Timestamp Ordering in Distributed Databases., и . ICCI, стр. 403-407. IEEE Computer Society, (1993)MaxMin Fair Flow Control Sensitive to Priorities., , и . OPODIS, стр. 45-60. Hermes, (1998)Fault Tolerant Network Constructors., , и . SSS, том 11914 из Lecture Notes in Computer Science, стр. 243-255. Springer, (2019)Cost Sharing Mechanisms for Fair Pricing of Resources Usage., , и . Algorithmic Aspects of Large and Complex Networks, том 05361 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, (2005)Information security for sensors by overwhelming random sequences and permutations., , , , и . ACM Conference on Computer and Communications Security, стр. 669-671. ACM, (2010)The Performance of Multistage Interconnection Networks with Finite Buffers., и . SIGMETRICS, стр. 263-264. ACM, (1990)