Journal: Computing

Volume 101, Issue 9

1225 -- 1226Ahmed Bouajjani, Hugues Fauconnier. Editorial, special issue of NETYS 2015
1227 -- 1240Jad Hamza. On the complexity of linearizability
1241 -- 1264Stéphane Devismes, Anissa Lamani, Franck Petit, Sébastien Tixeuil. Optimal torus exploration by oblivious robots
1265 -- 1286Triet Dang Vo-Huu, Erik-Oliver Blass, Guevara Noubir. EPiC: efficient privacy-preserving counting for MapReduce
1287 -- 1303Hajar El Hammouti, Loubna Echabbi, Rachid El Azouzi. A fully distributed learning algorithm for power allocation in heterogeneous networks
1305 -- 0Yahya Benkaouz, Mohammed Erradi. Special issue on NETYS'17 selected papers
1307 -- 1326Rezwana Reaz, Hrishikesh B. Acharya, Ehab S. Elmallah, Jorge Arturo Cobb, Mohamed G. Gouda. Policy expressions and the bottom-up design of computing policies
1327 -- 1348Driss Ait Omar, M'hamed Outanoute, Mohamed Baslam, Mohamed Fakir, Belaid Bouikhalene. On understanding price-QoS war for competitive market and confused consumers
1349 -- 1368Edward Talmage, Jennifer L. Welch. Anomalies and similarities among consensus numbers of variously-relaxed queues
1369 -- 1390Chen Avin, Louis Cohen, Mahmoud Parham, Stefan Schmid 0001. Competitive clustering of stochastic communication patterns on a ring