Home Research-feed Channel Rankings GCT THU AI TR Open Data Must Reading

views: 158

Andrzej Pelc

Professeur

Département d'informatique et d'ingénierie - Université du Québec en Outaouais

Sign in to view more

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

Andrzej Pelc, Ph.D,Professeur régulier Département d'informatique et d'ingénierie - Université du Québec en Outaouais.Miguel Vargas Martin (co-supervision à Carleton University), Enhancing hyperlink structure for improving web performance (2002, Ph.D.)

Papers343 papers

Sort

By YearBy Citation

Almost Universal Anonymous Rendezvous in the Plane

Bouchard Sébastien,Dieudonné Yoann,Pelc Andrzej,Petit Franck

SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures Virtual Event ..., pp.117-127, (2020)

EIBibtex

Advice Complexity of Treasure Hunt in Geometric Terrains

Pelc Andrzej, Yadav Ram Narayan

Bibtex

Building a Nest by an Automaton

Jurek Czyzowicz,Dariusz Dereniowski,Andrzej Pelc

Algorithmica, pp.1-33, (2020)

Bibtex

Latecomers Help to Meet - Deterministic Anonymous Gathering in the Plane

Andrzej Pelc, Ram Narayan Yadav

ICDCN, (2020)

EIBibtex

Deterministic Treasure Hunt in the Plane with Angular Hints

Sébastien Bouchard,Yoann Dieudonné,Andrzej Pelc,Franck Petit

Algorithmica, no. 11 (2020): 3250-3281

EIBibtex

Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs

Sébastien Bouchard,Yoann Dieudonné,Arnaud Labourel,Andrzej Pelc

Bibtex

Four Shades of Deterministic Leader Election in Anonymous Networks

Barun Gorain,Avery Miller,Andrzej Pelc

Bibtex

Deterministic Leader Election in Anonymous Radio Networks

Miller Avery,Pelc Andrzej, Yadav Ram Narayan

SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures Virtual Event ..., pp.407-417, (2020)

EIBibtex

Using Time to Break Symmetry: Universal Deterministic Anonymous Rendezvous

Andrzej Pelc,Ram Narayan Yadav

The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, (2019)

Cited by2EIBibtex

Building a Nest by an Automaton

Jurek Czyzowicz,Dariusz Dereniowski,Andrzej Pelc

ESA, (2019)

Cited by1EIBibtex

Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel

Kokouvi Hounkanli,Avery Miller,Andrzej Pelc

Theoretical Computer Science, (2019): 567-576

EIBibtex

Deciding and verifying network properties locally with few output bits

Heger Arfaoui,Pierre Fraigniaud,David Ilcinkas,Fabien Mathieu,Andrzej Pelc

Distributed Computing, no. 2 (2019): 169-187

EIBibtex

Cost vs. Information Tradeoffs for Treasure Hunt in the Plane

Andrzej Pelc, Ram Narayan Yadav

arXiv: Data Structures and Algorithms, (2019)

EIBibtex

Constant-Length Labeling Schemes for Deterministic Radio Broadcast

Faith Ellen,Barun Gorain,Avery Miller,Andrzej Pelc

The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, (2019)

Cited by6EIBibtex

Impact of Knowledge on Election Time in Anonymous Networks

Yoann Dieudonne,Andrzej Pelc

ALGORITHMICA, no. 1 (2019): 238.0-288

Bibtex

Reaching a Target in the Plane with no Information

Information Processing Letters, (2018): 13-17

Cited by6EIBibtex

Deterministic Treasure Hunt in the Plane with Angular Hints

Sébastien Bouchard,Yoann Dieudonné,Andrzej Pelc,Franck Petit

ISAAC, (2018)

Cited by3EIBibtex

Deterministic Meeting of Sniffing Agents in the Plane

Samir Elouasbi,Andrzej Pelc

Fundam. Inform., no. 3 (2018): 281-301

Cited by3EIBibtex

Finding the Size of a Radio Network with Short Labels

Barun Gorain,Andrzej Pelc

international conference of distributed computing and networking, (2018)

Cited by4EIBibtex

Explorable Families of Graphs

SIROCCO, pp.165-177, (2018)

EIBibtex

View All

Base Info Papers Patents Projects