Evangelos Kranakis

Orcid: 0000-0002-8959-4428

Affiliations:
  • Carleton University, Ottawa, Canada


According to our database1, Evangelos Kranakis authored at least 381 papers between 1982 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Overcoming probabilistic faults in disoriented linear search.
Theor. Comput. Sci., 2024

Optimal Delivery with a Faulty Drone.
CoRR, 2024

Invited Paper: A Survey of the Impact of Knowledge on the Competitive Ratio in Linear Search.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2024

Linear Search for an Escaping Target with Unknown Speed.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023
Optimal circle search despite the presence of faulty robots.
Inf. Process. Lett., August, 2023

Bike Assisted Evacuation on a Line of Robots with Communication Faults.
CoRR, 2023

Repeated Purification versus Concatenated Error Correction in Fault Tolerant Quantum Networks.
CoRR, 2023

Adaptive Virtual Carrier Sense in Underwater Broadcasting.
Proceedings of the 17th International Conference on Underwater Networks & Systems, 2023

Delivery to Safety with Two Cooperating Robots.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

Optimal Control for Platooning in Vehicular Networks.
Proceedings of the IEEE International Conference on Communications, 2023

Reinforcement Learning for Platooning Control in Vehicular Networks.
Proceedings of the IEEE Global Communications Conference, 2023

Reinforcement-Learning-Based Task Offloading in Edge Computing Systems with Firm Deadlines.
Proceedings of the IEEE Global Communications Conference, 2023

Optimal Task Offloading Policy in Edge Computing Systems with Firm Deadlines.
Proceedings of the IEEE Global Communications Conference, 2023

A Novel Underwater Packet Flooding Protocol.
Proceedings of the IEEE Canadian Conference on Electrical and Computer Engineering, 2023

2022
Research Trends in Collaborative Drones.
Sensors, 2022

On convergence and threshold properties of discrete Lotka-Volterra population protocols.
J. Comput. Syst. Sci., 2022

Optimal rendezvous on a line by location-aware robots in the presence of spies*.
Discret. Math. Algorithms Appl., 2022

Optimal Policy for Task Migration to UAV in Discrete-Time Systems with Firm Deadlines.
CoRR, 2022

Line Search for an Oblivious Moving Target.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022

Strategies for Surviving Aggressive Multiparty Repeated Standoffs (Extended Abstract).
Proceedings of the Learning and Intelligent Optimization - 16th International Conference, 2022

Uplink Interference Management in Cellular-Connected UAV Networks Using Multi-Armed Bandit and NOMA.
Proceedings of the IEEE Latin-American Conference on Communications, 2022

Evacuation from a Disk for Robots with Asymmetric Communication.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
Treasure evacuation with one robot on a disk.
Theor. Comput. Sci., 2021

Time-energy tradeoffs for evacuation by two robots in the wireless model.
Theor. Comput. Sci., 2021

GPS-Free, Error Tolerant Path Planning for Swarms of Micro Aerial Vehicles with Quality Amplification ‡.
Sensors, 2021

Robot Evacuation on a Line Assisted by a Bike.
Inf., 2021

Search on a Line by Byzantine Robots.
Int. J. Found. Comput. Sci., 2021

The Bike Sharing Problem.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Message Delivery in the Plane by Robots with Different Speeds.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021

Bike Assisted Evacuation on a Line.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Graph Exploration by Energy-Sharing Mobile Agents.
Proceedings of the Structural Information and Communication Complexity, 2021

Pilot Contamination Attack Detection in 5G Massive MIMO Systems Using Generative Adversarial Networks.
Proceedings of the IEEE International Mediterranean Conference on Communications and Networking, 2021

The Pony Express Communication Problem.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

Group Evacuation on a Line by Agents with Different Communication Abilities.
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Risky Zone Avoidance Strategies for Drones.
Proceedings of the 34th IEEE Canadian Conference on Electrical and Computer Engineering, 2021

Search and evacuation with a near majority of faulty agents.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
Gathering in the plane of location-aware robots in the presence of spies.
Theor. Comput. Sci., 2020

Priority evacuation from a disk: The case of <i>n</i> ≥ 4.
Theor. Comput. Sci., 2020

Priority evacuation from a disk: The case of <i>n</i> = 1, 2, 3.
Theor. Comput. Sci., 2020

Searching for a non-adversarial, uncooperative agent on a cycle.
Theor. Comput. Sci., 2020

Pantographs and Phase Transitions for the Boundedness of Orbits.
J. Inf. Process., 2020

Evacuating Robots from a Disk Using Face-to-Face Communication.
Discret. Math. Theor. Comput. Sci., 2020

Plane and planarity thresholds for random geometric graphs.
Discret. Math. Algorithms Appl., 2020

Optimal online and offline algorithms for robot-assisted restoration of barrier coverage.
Discret. Appl. Math., 2020

Weak Coverage of a Rectangular Barrier.
Algorithmica, 2020

Capacity Requirements in Networks of Quantum Repeaters and Terminals.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2020

Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020

Geocaching-Inspired Navigation for Micro Aerial Vehicles with Fallible Place Recognition.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 2020

2019
Patrolling.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Group Search and Evacuation.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Group search of the plane with faulty robots.
Theor. Comput. Sci., 2019

Tuning the demodulation frequency based on a normalized trajectory model for mobile underwater acoustic communications.
Trans. Emerg. Telecommun. Technol., 2019

Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models.
Discret. Math. Theor. Comput. Sci., 2019

Search on a line with faulty robots.
Distributed Comput., 2019

Quality Amplification of Error Prone Navigation for Swarms of Micro Aerial Vehicles (with Detailed Simulations).
CoRR, 2019

Symmetry Breaking in the Plane: Rendezvous by Robots with Unknown Attributes.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Gathering and Election by Mobile Robots in a Continuous Cycle.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Geocaching-inspired Resilient Path Planning for Drone Swarms.
Proceedings of the IEEE INFOCOM 2019, 2019

Energy Consumption of Group Search on a Line.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

Quality Amplification of Error Prone Navigation for Swarms of Micro Aerial Vehicles.
Proceedings of the 2019 IEEE Globecom Workshops, Waikoloa, HI, USA, December 9-13, 2019, 2019

2018
Know when to persist: Deriving value from a stream buffer.
Theor. Comput. Sci., 2018

Evacuating two robots from multiple unknown exits in a circle.
Theor. Comput. Sci., 2018

Doppler Effect in the Acoustic Ultra Low Frequency Band for Wireless Underwater Networks.
Mob. Networks Appl., 2018

Asymptotically optimal scheduling of random malleable demands in smart grid.
Discret. Math. Algorithms Appl., 2018

Priority Evacuation from a Disk Using Mobile Robots.
CoRR, 2018

Guest Editorial: Special Issue on Theoretical Informatics.
Algorithmica, 2018

Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits.
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018

Priority Evacuation from a Disk Using Mobile Robots - (Extended Abstract).
Proceedings of the Structural Information and Communication Complexity, 2018

Linear Rendezvous with Asymmetric Clocks.
Proceedings of the 22nd International Conference on Principles of Distributed Systems, 2018

God Save the Queen.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Low Frequency Mobile Communications in Underwater Networks.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks, 2018

2017
Searching with Advice: Robot Fence-Jumping.
J. Inf. Process., 2017

When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots.
Algorithmica, 2017

Learning to Communicate Underwater: An Exploration of Limited Mobility Agents.
Proceedings of the International Conference on Underwater Networks & Systems, 2017

Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs.
Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Evacuation from a Disc in the Presence of a Faulty Robot.
Proceedings of the Structural Information and Communication Complexity, 2017

Weak Coverage of a Rectangular Barrier.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Linear Search with Terrain-Dependent Speeds.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

Querying with Uncertainty.
Proceedings of the Algorithms for Sensor Systems, 2017

Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults.
Proceedings of the Algorithms for Sensor Systems, 2017

The Sound of Communication in Underwater Acoustic Sensor Networks - (Position Paper).
Proceedings of the Ad Hoc Networks, 2017

Doppler Effect in the Underwater Acoustic Ultra Low Frequency Band.
Proceedings of the Ad Hoc Networks, 2017

2016
Mobile Agents and Exploration.
Encyclopedia of Algorithms, 2016

Strong connectivity of sensor networks with double antennae.
Theor. Comput. Sci., 2016

Channel selection using a multiple radio model.
J. Netw. Comput. Appl., 2016

Sensor allocation problems on the real line.
J. Appl. Probab., 2016

On the displacement for covering a unit interval with randomly placed sensors.
Inf. Process. Lett., 2016

Survivability of bouncing robots.
Discret. Math. Algorithms Appl., 2016

Distributed algorithms for barrier coverage using relocatable sensors.
Distributed Comput., 2016

Neighbor Discovery in a Sensor Network with Directional Antennae.
Ad Hoc Sens. Wirel. Networks, 2016

On the displacement for covering a d-dimensional cube with randomly placed sensors.
Ad Hoc Networks, 2016

Distributed Patrolling with Two-Speed Robots (and an Application to Transportation).
Proceedings of the Operations Research and Enterprise Systems, 2016

Fence Patrolling with Two-speed Robots.
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems (ICORES 2016), 2016

Patrolling Trees with Mobile Robots.
Proceedings of the Foundations and Practice of Security - 9th International Symposium, 2016

Search-and-Fetch with One Robot on a Disk - (Track: Wireless and Geometry).
Proceedings of the Algorithms for Sensor Systems, 2016

Reconstructing Cactus Graphs from Shortest Path Information - (Extended Abstract).
Proceedings of the Algorithmic Aspects in Information and Management, 2016

Know When to Persist: Deriving Value from a Stream Buffer - (Extended Abstract).
Proceedings of the Algorithmic Aspects in Information and Management, 2016

2015
Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae.
Theor. Comput. Sci., 2015

Excuse me! or the courteous theatregoers' problem.
Theor. Comput. Sci., 2015

Complexity of barrier coverage with relocatable sensors in the plane.
Theor. Comput. Sci., 2015

The Beachcombers' Problem: Walking and searching with mobile robots.
Theor. Comput. Sci., 2015

Position discovery for a system of bouncing robots.
Inf. Comput., 2015

Introduction to the Special Issue: Combinatorics and Geometry.
Graphs Comb., 2015

Monitoring the Plane with Rotating Radars.
Graphs Comb., 2015

Searching for majority with k-tuple queries.
Discret. Math. Algorithms Appl., 2015

Localization for a system of colliding robots.
Distributed Comput., 2015

Information Spreading by Mobile Particles on a Line.
Proceedings of the Structural Information and Communication Complexity, 2015

Refracted Acoustic Communications in Wireless Underwater Sensor Networks with Mobility.
Proceedings of the SENSORNETS 2015, 2015

Randomized Rendezvous Algorithms for Agents on a Ring with Different Speeds.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

Optimization Problems in Infrastructure Security.
Proceedings of the Foundations and Practice of Security - 8th International Symposium, 2015

Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract).
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Location-free link state routing for underwater acoustic sensor networks.
Proceedings of the IEEE 28th Canadian Conference on Electrical and Computer Engineering, 2015

Simulation of underwater communications with a colored noise approximation and mobility.
Proceedings of the IEEE 28th Canadian Conference on Electrical and Computer Engineering, 2015

Maintaining Intruder Detection Capability in a Rectangular Domain with Sensors.
Proceedings of the Algorithms for Sensor Systems, 2015

On the Displacement for Covering a Square with Randomly Placed Sensors.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

Localization of a Mobile Node in Shaded Areas.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

Rendezvous of Many Agents with Different Speeds in a Cycle.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

Wireless Autonomous Robot Evacuation from Equilateral Triangles and Squares.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 14th International Conference, 2015

2014
Editorial: Fun with Algorithms.
Theory Comput. Syst., 2014

On the event distance of Poisson processes with applications to sensors.
Discret. Appl. Math., 2014

Broadcasting in Networks of Unknown Topology in the Presence of Swamping.
CoRR, 2014

Evacuating Robots via Unknown Exit in a Disk.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

The Bidirectional Algorithm for Channel Selection Using a Two-Radio Model.
Proceedings of the IEEE 80th Vehicular Technology Conference, 2014

Optimal charging strategies for electrical vehicles under real time pricing.
Proceedings of the 2014 IEEE International Conference on Smart Grid Communications, 2014

Patrolling by Robots Equipped with Visibility.
Proceedings of the Structural Information and Communication Complexity, 2014

Survivability of Swarms of Bouncing Robots.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

A new analysis of the cognitive radio jump-stay algorithm under the asymmetric model.
Proceedings of the IEEE International Conference on Communications, 2014

Excuse Me! or The Courteous Theatregoers' Problem - (Extended Abstract).
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

Displacing Random Sensors to Avoid Interference.
Proceedings of the Computing and Combinatorics - 20th International Conference, 2014

The Multi-source Beachcombers' Problem.
Proceedings of the Algorithms for Sensor Systems, 2014

Revisiting the Performance of the Modular Clock Algorithm for Distributed Blind Rendezvous in Cognitive Radio Networks.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 13th International Conference, 2014

2013
A multipath routing strategy to prevent flooding disruption attacks in link state routing protocols for MANETs.
J. Netw. Comput. Appl., 2013

Strongly connected orientations of plane graphs.
Discret. Appl. Math., 2013

Asymptotic structural properties of quasi-random saturated structures of RNA.
Algorithms Mol. Biol., 2013

QoS and security in Link State Routing protocols for MANETs.
Proceedings of the IFIP Wireless Days, 2013

A new analytic model for the cognitive radio jump-stay algorithm.
Proceedings of the IFIP Wireless Days, 2013

Expected sum and maximum of displacement of random sensors for coverage of a domain: extended abstract.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Optimal patrolling of fragmented boundaries.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

Asymptotic convex optimization for packing random malleable demands in smart grid.
Proceedings of IEEE International Conference on Communications, 2013

Power strip packing of malleable demands in smart grid.
Proceedings of IEEE International Conference on Communications, 2013

Approximation Algorithms for the Antenna Orientation Problem.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

Strong Connectivity of Wireless Sensor Networks with Double Directional Antennae in 3D.
Proceedings of the Ad-hoc, Mobile, and Wireless Network - 12th International Conference, 2013

2012
Computing majority with triple queries.
Theor. Comput. Sci., 2012

Maintaining Privacy on a Line.
Theory Comput. Syst., 2012

Bounded Length, 2-Edge Augmentation of Geometric Planar Graphs.
Discret. Math. Algorithms Appl., 2012

Optimizing Data Throughput in Client/Server Systems by keeping Queue Sizes Balanced.
Discret. Math. Algorithms Appl., 2012

Strong Connectivity in Sensor Networks with given Number of Directional Antennae of Bounded Angle.
Discret. Math. Algorithms Appl., 2012

Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Cooperative Neighbor Discovery Protocol for a Wireless Network Using Two Antenna Patterns.
Proceedings of the 32nd International Conference on Distributed Computing Systems Workshops (ICDCS 2012 Workshops), 2012

Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs.
Proceedings of the Computer Science - Theory and Applications, 2012

Stretch Factor in Wireless Sensor Networks with Directional Antennae.
Proceedings of the Combinatorial Optimization and Applications, 2012

Uninterrupted Coverage of a Planar Region with Rotating Directional Antennae.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 11th International Conference, 2012

2011
Maintaining Connectivity in Sensor Networks Using Directional Antennae.
Proceedings of the Theoretical Aspects of Distributed Computing in Sensor Networks, 2011

Local 7-coloring for planar subgraphs of unit disk graphs.
Theor. Comput. Sci., 2011

Randomized rendezvous with limited memory.
ACM Trans. Algorithms, 2011

Deterministic symmetric rendezvous with tokens in a synchronous torus.
Discret. Appl. Math., 2011

Analysing local algorithms in location-aware quasi-unit-disk graphs.
Discret. Appl. Math., 2011

Location-Oblivious Distributed Unit Disk Graph Coloring.
Algorithmica, 2011

Proactive Threshold Cryptosystem for EPC Tags.
Ad Hoc Sens. Wirel. Networks, 2011

Secure geolocalization of wireless sensor nodes in the presence of misbehaving anchor nodes.
Ann. des Télécommunications, 2011

Planar Subgraphs without Low-Degree Nodes.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

On the Complexity of the Multi-Robot, Multi-Depot Map Visitation Problem.
Proceedings of the IEEE 8th International Conference on Mobile Adhoc and Sensor Systems, 2011

Connectivity Trade-offs in 3D Wireless Sensor Networks Using Directional Antennae.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Preventing the Cluster Formation Attack against the Hierarchical OLSR Protocol.
Proceedings of the Foundations and Practice of Security, 2011

Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds.
Proceedings of the Algorithms - ESA 2011, 2011

Distributed Key Establishment in Disruption Tolerant Location Based Social Wireless Sensor and Actor Network.
Proceedings of the Ninth Annual Communication Networks and Services Research Conference, 2011

Mitigation of Flooding Disruption Attacks in Hierarchical OLSR Networks.
Proceedings of the Ninth Annual Communication Networks and Services Research Conference, 2011

2010
The Mobile Agent Rendezvous Problem in the Ring
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-01999-9, 2010

A geometric routing protocol in disruption tolerant network.
Int. J. Parallel Emergent Distributed Syst., 2010

The diameter and connectivity of networks with random dependent faults.
Networks, 2010

A Tight Bound on the Maximum Interference of Random Sensors in the Highway Model
CoRR, 2010

Communication in Random Geometric Radio Networks with Positively Correlated Random Faults.
Ad Hoc Sens. Wirel. Networks, 2010

Distributed storage in Disruption Tolerant Network.
Proceedings of the 11th IEEE International Symposium on a World of Wireless, 2010

Using time-of-day and location-based mobility profiles to improve scanning during handovers.
Proceedings of the 11th IEEE International Symposium on a World of Wireless, 2010

Broadcasting in Sensor Networks of Unknown Topology in the Presence of Swamping.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Strong Orientations of Planar Graphs with Bounded Stretch Factor.
Proceedings of the Structural Information and Communication Complexity, 2010

Maximum Interference of Random Sensors on a Line.
Proceedings of the Structural Information and Communication Complexity, 2010

The Urinal Problem.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

Mitigation of topology control traffic attacks in OLSR networks.
Proceedings of the CRiSIS 2010, 2010

Optimal Balancing of Satellite Queues in Packet Transmission to Ground Stations.
Proceedings of the Combinatorial Optimization and Applications, 2010

Prioritized Access for Emergency Stations in Next Generation Broadband Wireless Networks.
Proceedings of the 8th Annual Conference on Communication Networks and Services Research, 2010

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 9th International Conference, 2010

2009
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs.
Theor. Comput. Sci., 2009

Optimal movement of mobile sensors for barrier coverage of a planar region.
Theor. Comput. Sci., 2009

Balancing Traffic Load Using One-Turn Rectilinear Routing.
J. Interconnect. Networks, 2009

Asymptotics of Canonical and Saturated RNA Secondary Structures.
J. Bioinform. Comput. Biol., 2009

Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs.
Discret. Math. Algorithms Appl., 2009

Random maximal independent sets and the unfriendly theater seating arrangement problem.
Discret. Math., 2009

Evaluation of Anonymized ONS Queries
CoRR, 2009

Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs?
Ad Hoc Sens. Wirel. Networks, 2009

A Hop Count Based Greedy Face Greedy Routing Protocol on Localized Geometric Spanners.
Proceedings of the MSN 2009, 2009

Sensor network connectivity with multiple directional antennae of a given angular sum.
Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

Security Threat Mitigation Trends in Low-Cost RFID Systems.
Proceedings of the Data Privacy Management and Autonomous Spontaneous Security, 2009

Secure Localization of Nodes in Wireless Sensor Networks with Limited Number of Truth Tellers.
Proceedings of the 7th Annual Conference on Communication Networks and Services Research, 2009

Detection of slow malicious worms using multi-sensor data fusion.
Proceedings of the 2009 IEEE Symposium on Computational Intelligence for Security and Defense Applications, 2009

An integrated approach to detection of fast and slow scanning worms.
Proceedings of the 2009 ACM Symposium on Information, 2009

Inapproximability of the Perimeter Defense Problem.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

Asymptotics of Canonical RNA Secondary Structures.
Proceedings of the Ninth IEEE International Conference on Bioinformatics and Bioengineering, 2009

Routing on Delay Tolerant Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment.
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, 2009

2008
Mobile Agents and Exploration.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Memoryless search algorithms in a network with faulty advice.
Theor. Comput. Sci., 2008

Tracking Mobile Users in Cellular Networks using Timing Information.
Nord. J. Comput., 2008

On the false-positive rate of Bloom filters.
Inf. Process. Lett., 2008

Constant memory routing in quasi-planar and quasi-polyhedral graphs.
Discret. Appl. Math., 2008

Impact of Locality on Location Aware Unit Disk Graphs.
Algorithms, 2008

Introduction to the Special Issue.
Ad Hoc Sens. Wirel. Networks, 2008

Incremental Construction of k-Dominating Sets in Wireless Sensor Networks.
Ad Hoc Sens. Wirel. Networks, 2008

Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Communication in wireless networks with directional antennas.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring.
Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Randomized Rendez-Vous with Limited Memory.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Security Threats on EPC Based RFID Systems.
Proceedings of the Fifth International Conference on Information Technology: New Generations (ITNG 2008), 2008

Analysis of Threats to the Security of EPC Networks.
Proceedings of the Sixth Annual Conference on Communication Networks and Services Research (CNSR 2008), 2008

Memory Requirements for Local Geometric Routing and Traversal in Digraphs.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

Local Maximal Matching and Local 2-Approximation for Vertex Cover in UDGs.
Proceedings of the Ad-hoc, Mobile and Wireless Networks, 7th International Conference, 2008

2007
Computing with Mobile Agents in Distributed Networks.
Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

On interdomain routing security and pretty secure BGP (psBGP).
ACM Trans. Inf. Syst. Secur., 2007

Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov-Jacobson energy model.
Discret. Appl. Math., 2007

Assigning Bookmarks in Perfect Binary Trees.
Ars Comb., 2007

Communication in Networks with Random Dependent Faults.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Tracking Darkports for Network Defense.
Proceedings of the 23rd Annual Computer Security Applications Conference (ACSAC 2007), 2007

Strategies for fast scanning and handovers in WiMAX/802.16.
Proceedings of the 2nd International ICST Conference on Access Networks, 2007

Principles of ad hoc networking.
Wiley, 2007

2006
Asynchronous deterministic rendezvous in graphs.
Theor. Comput. Sci., 2006

Deterministic M2M multicast in radio networks.
Theor. Comput. Sci., 2006

Route discovery with constant memory in oriented planar geometric networks.
Networks, 2006

Strategies for Service Discovery over Ad Hoc Networks.
Eng. Lett., 2006

Credentials and Beliefs in Remote Trusted Platforms Attestation.
Proceedings of the 2006 International Symposium on a World of Wireless, 2006

Routing with uncertainty in the position of the destination.
Proceedings of the 2006 IEEE International Conference on Wireless and Mobile Computing, 2006

Exposure Maps: Removing Reliance on Attribution During Scan Detection.
Proceedings of the 1st USENIX Workshop on Hot Topics in Security, 2006

An Algorithmic Theory of Mobile Agents.
Proceedings of the Trustworthy Global Computing, Second Symposium, 2006

Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Mobile Agent Rendezvous: A Survey.
Proceedings of the Structural Information and Communication Complexity, 2006

Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs.
Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

Incremental Construction of <i>k</i>-Dominating Sets in Wireless Sensor Networks.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

Mobile Agent Rendezvous in a Synchronous Torus.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Detecting rogue devices in bluetooth networks using radio frequency fingerprinting.
Proceedings of the Third IASTED International Conference on Communications and Computer Networks, 2006

Addressing SMTP-Based Mass-Mailing Activity within Enterprise Networks.
Proceedings of the 22nd Annual Computer Security Applications Conference (ACSAC 2006), 2006

2005
Routing and Traversal via Location Awareness in Ad Hoc Networks.
Proceedings of the Handbook of Algorithms for Wireless Networking and Mobile Computing., 2005

Games on triangulations.
Theor. Comput. Sci., 2005

Distributed Dynamic Storage in Wireless Networks.
Int. J. Distributed Sens. Networks, 2005

Special Issue on Typical Case Complexity and Phase Transitions.
Discret. Appl. Math., 2005

Anomaly-based intrusion detection using mobility profiles of public transportation users.
Proceedings of the 2005 IEEE International Conference on Wireless And Mobile Computing, 2005

Approximate Range Mode and Range Median Queries.
Proceedings of the STACS 2005, 2005

Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

DNS-based Detection of Scanning Worms in an Enterprise Network.
Proceedings of the Network and Distributed System Security Symposium, 2005

Pretty Secure BGP, psBGP.
Proceedings of the Network and Distributed System Security Symposium, 2005

Panel: Authentication in Constrained Environments.
Proceedings of the Secure Mobile Ad-hoc Networks and Sensors, First International Workshop, 2005

Detecting Impersonation Attacks in Future Wireless and Mobile Networks.
Proceedings of the Secure Mobile Ad-hoc Networks and Sensors, First International Workshop, 2005

Detecting Intra-enterprise Scanning Worms based on Address Resolution.
Proceedings of the 21st Annual Computer Security Applications Conference (ACSAC 2005), 2005

2004
Sorting and election in anonymous asynchronous rings.
J. Parallel Distributed Comput., 2004

Traversal of a quasi-planar subdivision without using mark bits.
J. Interconnect. Networks, 2004

Tree exploration with little memory.
J. Algorithms, 2004

Approximate hotlink assignment.
Inf. Process. Lett., 2004

Searching with mobile agents in networks with liars.
Discret. Appl. Math., 2004

Mobile Agents Rendezvous When Tokens Fail.
Proceedings of the Structural Information and Communication Complexity, 2004

Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks.
Proceedings of the Structural Information and Communication Complexity, 2004

Directional Versus Omnidirectional Antennas for Energy Consumption and <i>k</i>-Connectivity of Networks of Sensors.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Multiple Mobile Agent Rendezvous in a Ring.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Securing the Destination-Sequenced Distance Vector Routing Protocol (S-DSDV).
Proceedings of the Information and Communications Security, 6th International Conference, 2004

Deterministic M2M Multicast in Radio Networks: (Extended Abstract).
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

Coverage and Connectivity in Networks with Directional Sensors.
Proceedings of the Euro-Par 2004 Parallel Processing, 2004

Enhancing intrusion detection in wireless networks using radio frequency fingerprinting.
Proceedings of the IASTED International Conference on Communications, Internet, and Information Technology, November 22, 2004

Improving Distance Based Geographic Location Techniques in Sensor Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

S-RIP: A Secure Distance Vector Routing Protocol.
Proceedings of the Applied Cryptography and Network Security, 2004

2003
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory.
Networks, 2003

Enhancing Hyperlink Structure for Improving Web Performance.
J. Web Eng., 2003

Preface: Volume 16.
Electron. Notes Discret. Math., 2003

Tracking Users in Cellular Networks using Timing Information.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Bounds for Frequency Estimation of Packet Streams.
Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Secure Wireless Payment Protocol.
Proceedings of the International Conference on Wireless Networks, 2003

Modeling and Performance Analysis of Service Discovery Strategies in Ad Hoc Networks.
Proceedings of the International Conference on Wireless Networks, 2003

Mobile Agent Rendezvous in a Ring.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

Optimizing Web Server's Data Transfer with Hotlinks.
Proceedings of the IADIS International Conference WWW/Internet 2003, 2003

Improving Customer Proximity to Railway Stations.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

Resisting Malicious Packet Dropping in Wireless Ad Hoc Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002
Boolean Functions and Computation Models
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 3540594361, 2002

The impact of information on broadcasting time in linear radio networks.
Theor. Comput. Sci., 2002

Station Layouts in the Presence of Location Constraints.
J. Interconnect. Networks, 2002

Playing with Triangulations.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

The Hotlink Optimizer.
Proceedings of the International Conference on Internet Computing, 2002

2001
Rigorous results for random (2+p)-SAT.
Theor. Comput. Sci., 2001

On Recognizing a String on an Anonymous Ring.
Theory Comput. Syst., 2001

Fault-Tolerant Broadcasting in Radio Networks.
J. Algorithms, 2001

Distributed computing on oriented anonymous hypercubes with faulty components.
Distributed Comput., 2001

Ray shooting from convex ranges.
Discret. Appl. Math., 2001

Random Constraint Satisfaction: A More Accurate Picture.
Constraints An Int. J., 2001

Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval.
Comput. J., 2001

Efficient Routing in Networks with Long Range Contacts.
Proceedings of the Distributed Computing, 15th International Conference, 2001

2000
Power consumption in packet radio networks.
Theor. Comput. Sci., 2000

Better Adaptive Diagnosis of Hypercubes.
IEEE Trans. Computers, 2000

Locating Information with Uncertainty in Fully Interconnected Networks.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Strategies for Hotlink Assignments.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Sorting Multisets in Anonymous Rings.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

Guarding the Convex Subsets of a Point-set.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

Flipping your Lid.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks.
SIAM J. Comput., 1999

Optimal adaptive fault diagnosis for simple multiprocessor systems.
Networks, 1999

Baked-Potato Routing.
J. Algorithms, 1999

Minimizing Congestion of Layouts for ATM Networks with Faulty Links.
Int. J. Found. Comput. Sci., 1999

Isomorphic Triangulations with Small Number of Steiner Points.
Int. J. Comput. Geom. Appl., 1999

Searching with Uncertainty.
Proceedings of the SIROCCO'99, 1999

The Impact of Knowledge on Broadcasting Time in Radio Networks.
Proceedings of the Algorithms, 1999

Compass routing on geometric networks.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Dissections, cuts and triangulations.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Domino tilings of orthogonal polygons.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

Near optimal-partitioning of rectangles and prisms.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Approximate Maxima Finding of Continuous Functions under Restricted Budget.
Theor. Comput. Sci., 1998

Approximating the unsatisfiability threshold of random formulas.
Random Struct. Algorithms, 1998

Broadcasting in Unlabeled Tori.
Parallel Process. Lett., 1998

Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages.
Inf. Process. Lett., 1998

A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments.
Inf. Process. Lett., 1998

Perfect Broadcasting in Unlabeled Networks.
Discret. Appl. Math., 1998

Efficient Regular Polygon Dissections.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Algorithms for Packing Two Circles in a Convex Polygon.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Polygon Cutting: Revisited.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

High-Speed Networks.
Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract).
Proceedings of the Algorithms, 1998

1997
Planar Stage Graphs: Characterizations and Applications.
Theor. Comput. Sci., 1997

Time-Message Trade-Offs for the Weak Unison Problem.
Nord. J. Comput., 1997

Distributed Computing on Anonymous Hypercube Networks.
J. Algorithms, 1997

Hop-Congestion Trade-Offs for High-Speed Networks.
Int. J. Found. Comput. Sci., 1997

Special Issue: Selected Areas in Cryptography - Introduction.
Des. Codes Cryptogr., 1997

The VC-dimension of Set Systems Defined by Graphs.
Discret. Appl. Math., 1997

Stage-graph Representations.
Discret. Appl. Math., 1997

Power Consumption in Packet Radio Networks (Extended Abstract).
Proceedings of the STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27, 1997

Heterogeneous Server Placement in the Network Centric Computing Paradigm.
Proceedings of the On Principles Of Distributed Systems, 1997

Discrete Realizations of Contact and Intersection Graphs.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Almost optimal on-line search in unknown streets.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

Domino tilings and two-by-two squares.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997

1996
On Multi-Label Linear Interval Routing Schemes.
Comput. J., 1996

Approximate Maxima Finding of Continuous Functions Under Restricted Budget (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

Lower Bounds for Compact Routing (Extended Abstract).
Proceedings of the STACS 96, 1996

Boolean Routing on Cayley Networks.
Proceedings of the SIROCCO'96, 1996

Invited Talk: Symmetry and Computability in Anonymous Networks.
Proceedings of the SIROCCO'96, 1996

The Complexity of Data Mining on the Web (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Baked Potatoes: Deadlock Prevention Via Scheduling (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract).
Proceedings of the Algorithms, 1996

A better upper bound for the unsatisfiability threshold.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

Maximal Length Common Non-intersecting Paths.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
Anonymous Wireless Rings.
Theor. Comput. Sci., 1995

Labeled Versus Unlabeled Distributed Cayley Networks.
Discret. Appl. Math., 1995

VC-Dimensions for Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Implicit Routing and Shortest Path Information (Extended Abstract).
Proceedings of the Structure, Information and Communication Complexity, 1995

String Recognition on Anonymous Rings.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

Optimal Shooting: Characterizations and Applications.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
Computing Boolean Functions on Anonymous Networks
Inf. Comput., November, 1994

Optimal Coteries and Voting Schemes.
Inf. Process. Lett., 1994

Camera Placement in Integer Lattices.
Discret. Comput. Geom., 1994

Counting Problems Relating to a Theorem of Dirichlet.
Comput. Geom., 1994

The Buffer Potential of a Network.
Proceedings of the Structural Information and Communication Complexity, 1994

On the Number of Directions in Visibility Representations.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

On Key Distribution via True Broadcasting.
Proceedings of the CCS '94, 1994

1993
On Multi-Label Linear Interval Routing Schemes (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

1992
A Note on Weighted Distributed Match-Making.
Math. Syst. Theory, 1992

Distributed Computing on Anonymous Hypercubes with Faulty Components (Extended Abstract).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Distributed Computing on Cayley Networks (Extended Abstract).
Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing, 1992

1991
Boolean Functions, Invariance Groups, and Parallel Complexity.
SIAM J. Comput., 1991

1990
Enumeration and Visibility Problems in Integer Lattices (Extended Abstract).
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Optimal packing of similar triangles.
Bull. EATCS, 1989

Functional Dependencies of Variables in Wait-Free Programs (Extended Abstract).
Proceedings of the Distributed Algorithms, 1989

1988
A Proof Technique for Register Automicity.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

Weighted Distributed Match-Making.
Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987
Fixed Point Equations with Parameters in the Projective Model
Inf. Comput., December, 1987

Atomic Multireader Register.
Proceedings of the Distributed Algorithms, 1987

1986
Primality and cryptography.
Wiley-Teubner series in computer science, Teubner, ISBN: 978-0-471-90934-7, 1986

1985
Definable partitions and reflection properties for regular cardinals.
Notre Dame J. Formal Log., 1985

Definable Partitions and the Projectum.
Math. Log. Q., 1985

1984
Definable Ultrapowers and Ultrafilters over Admissible Ordinals.
Math. Log. Q., 1984

Stepping Up Lemmas in Definable Partitions.
J. Symb. Log., 1984

1983
Definable Ramsey and definable Erdös ordinals.
Arch. Math. Log., 1983

1982
Definable Ultrafilters and end Extension of Constructible Sets.
Math. Log. Q., 1982

Invisible Ordinals and Inductive Definitions.
Math. Log. Q., 1982

Reflection and partition properties of admissible ordinals.
Ann. Math. Log., 1982


  Loading...