2 citations
- IMDEA NetworksES3 papers
- Pace UniversityUS3 papers
- Universidad Carlos III de MadridES2 papers
- University of LiverpoolGB2 papers
- Centre National de la Recherche ScientifiqueFR1 paper
- Chinese Academy of SciencesCN1 paper
- Institute of Computing TechnologyCN1 paper
- Institut Polytechnique de BordeauxFR1 paper
- Laboratoire Bordelais de Recherche en InformatiqueFR1 paper
- Laboratoire d'Analyse et d'Architecture des SystèmesFR1 paper
- Las Cumbres Observatory Global Telescope NetworkUS1 paper
- Purdue University West LafayetteUS1 paper
10 papers
Low-genus primitive monodromy groups with a nonunique minimal normal subgroup
Spencer Gerhardt, Eilidh McKemmie, Danny Neftin
Let be a Riemann surface, and let be an indecomposable (branched) covering of genus and degree whose monodromy group has more than one m…
On the on-line coloring of unit interval graphs with proper interval representation
Israel R. Curbelo, Hannah R. Malko
We define the problem as a two-player game between Algorithm and Builder. The game is played in rounds. Each round, Builder presents an interval that is neither contained in nor co…
Station Assignment with Reallocation
Austin Halper, Miguel A. Mosteiro, Yulia Rossikova +1
We study a dynamic allocation problem that arises in various scenarios where mobile clients joining and leaving the system have to communicate with static stations via radio transm…
Internet Computing: Using Reputation to Select Workers from a Pool
Evgenia Christoforou, Antonio Fernández Anta, Chryssis Georgiou +1
The assignment and execution of tasks over the Internet is an inexpensive solution in contrast with supercomputers. We consider an Internet-based Master-Worker task computing appro…
Counting in Practical Anonymous Dynamic Networks is Polynomial
Maitri Chakraborty, Alessia Milani, Miguel A. Mosteiro
Anonymous Dynamic Networks is a harsh computational environment due to changing topology and lack of identifiers. Computing the size of the network, a problem known as Counting, is…
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
Dariusz R. Kowalski, Miguel A. Mosteiro, Kevin Zaki
We study a dynamic version of the Multiple-Message Broadcast problem, where packets are continuously injected in network nodes for dissemination throughout the network. Our perform…