9 Search Results for "Marr�n, Pedro J�se"

Document
DOI: 10.4230/OASIcs.SLATE.2023.13
Characterization and Identification of Programming Languages

Authors: Júlio Alves, Alvaro Costa Neto, Maria João Varanda Pereira, and Pedro Rangel Henriques

Published in: OASIcs, Volume 113, 12th Symposium on Languages, Applications and Technologies (SLATE 2023)

Abstract
This paper presents and discusses a research work whose main goal is to identify which characteristics influence the recognition and identification, by a programmer, of a programming language, specifically analysing a program source code and its linguistic style. In other words, the study that is described aims at answering the following questions: which grammatical elements - including lexical, syntactic, and semantic details - contribute the most for the characterization of a language? How many structural elements of a language may be modified without losing its identity? The long term objective of such research is to acquire new insights on the factors that can lead language engineers to design new programming languages that reduce the cognitive load of both learners and programmers. To elaborate on that subject, the paper starts with a brief explanation of programming languages fundamentals. Then, a list of the main syntactic characteristics of a set of programming languages, chosen for the study, is presented. Those characteristics outcome from the analysis we carried on at first phase of our project. To go deeper on the investigation we decided to collect and analyze the opinion of other programmers. So, the design of a survey to address that task is discussed. The answers obtained from the application of the questionnaire are analysed to present an overall picture of programming languages characteristics and their relative influence to their identification from the programmers’ perspective.
Cite as

Júlio Alves, Alvaro Costa Neto, Maria João Varanda Pereira, and Pedro Rangel Henriques. Characterization and Identification of Programming Languages. In 12th Symposium on Languages, Applications and Technologies (SLATE 2023). Open Access Series in Informatics (OASIcs), Volume 113, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{alves_et_al:OASIcs.SLATE.2023.13,
  author =	{Alves, J\'{u}lio and Costa Neto, Alvaro and Pereira, Maria Jo\~{a}o Varanda and Henriques, Pedro Rangel},
  title =	{{Characterization and Identification of Programming Languages}},
  booktitle =	{12th Symposium on Languages, Applications and Technologies (SLATE 2023)},
  pages =	{13:1--13:13},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-291-4},
  ISSN =	{2190-6807},
  year =	{2023},
  volume =	{113},
  editor =	{Sim\~{o}es, Alberto and Ber\'{o}n, Mario Marcelo and Portela, Filipe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2023.13},
  URN =		{urn:nbn:de:0030-drops-185273},
  doi =		{10.4230/OASIcs.SLATE.2023.13},
  annote =	{Keywords: Programming Languages, Programming Language Characterization, Programming Language Design, Programming Language Identification}
}
Document
DOI: 10.4230/LIPIcs.OPODIS.2022.20
Computing Power of Hybrid Models in Synchronous Networks

Authors: Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, and Ioan Todinca

Published in: LIPIcs, Volume 253, 26th International Conference on Principles of Distributed Systems (OPODIS 2022)

Abstract
During the last two decades, a small set of distributed computing models for networks have emerged, among which LOCAL, CONGEST, and Broadcast Congested Clique (BCC) play a prominent role. We consider hybrid models resulting from combining these three models. That is, we analyze the computing power of models allowing to, say, perform a constant number of rounds of CONGEST, then a constant number of rounds of LOCAL, then a constant number of rounds of BCC, possibly repeating this figure a constant number of times. We specifically focus on 2-round models, and we establish the complete picture of the relative powers of these models. That is, for every pair of such models, we determine whether one is (strictly) stronger than the other, or whether the two models are incomparable. The separation results are obtained by approaching communication complexity through an original angle, which may be of an independent interest. The two players are not bounded to compute the value of a binary function, but the combined outputs of the two players are constrained by this value. In particular, we introduce the XOR-Index problem, in which Alice is given a binary vector x ∈ {0,1}ⁿ together with an index i ∈ [n], Bob is given a binary vector y ∈ {0,1}ⁿ together with an index j ∈ [n], and, after a single round of 2-way communication, Alice must output a boolean out_A, and Bob must output a boolean out_B, such that out_A ∧ out_B = x_j⊕ y_i. We show that the communication complexity of XOR-Index is Ω(n) bits.
Cite as

Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, and Ioan Todinca. Computing Power of Hybrid Models in Synchronous Networks. In 26th International Conference on Principles of Distributed Systems (OPODIS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 253, pp. 20:1-20:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{fraigniaud_et_al:LIPIcs.OPODIS.2022.20,
  author =	{Fraigniaud, Pierre and Montealegre, Pedro and Paredes, Pablo and Rapaport, Ivan and R{\'\i}os-Wilson, Mart{\'\i}n and Todinca, Ioan},
  title =	{{Computing Power of Hybrid Models in Synchronous Networks}},
  booktitle =	{26th International Conference on Principles of Distributed Systems (OPODIS 2022)},
  pages =	{20:1--20:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-265-5},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{253},
  editor =	{Hillel, Eshcar and Palmieri, Roberto and Rivi\`{e}re, Etienne},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2022.20},
  URN =		{urn:nbn:de:0030-drops-176401},
  doi =		{10.4230/LIPIcs.OPODIS.2022.20},
  annote =	{Keywords: hybrid model, synchronous networks, LOCAL, CONGEST, Broadcast Congested Clique}
}
Document
DOI: 10.4230/LIPIcs.ITCS.2022.88
Explicit Abelian Lifts and Quantum LDPC Codes

Authors: Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell, Pedro Paredes, and Madhur Tulsiani

Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)

Abstract
For an abelian group H acting on the set [𝓁], an (H,𝓁)-lift of a graph G₀ is a graph obtained by replacing each vertex by 𝓁 copies, and each edge by a matching corresponding to the action of an element of H. Expanding graphs obtained via abelian lifts, form a key ingredient in the recent breakthrough constructions of quantum LDPC codes, (implicitly) in the fiber bundle codes by Hastings, Haah and O'Donnell [STOC 2021] achieving distance Ω̃(N^{3/5}), and in those by Panteleev and Kalachev [IEEE Trans. Inf. Theory 2021] of distance Ω(N/log(N)). However, both these constructions are non-explicit. In particular, the latter relies on a randomized construction of expander graphs via abelian lifts by Agarwal et al. [SIAM J. Discrete Math 2019]. In this work, we show the following explicit constructions of expanders obtained via abelian lifts. For every (transitive) abelian group H ⩽ Sym(𝓁), constant degree d ≥ 3 and ε > 0, we construct explicit d-regular expander graphs G obtained from an (H,𝓁)-lift of a (suitable) base n-vertex expander G₀ with the following parameters: ii) λ(G) ≤ 2√{d-1} + ε, for any lift size 𝓁 ≤ 2^{n^{δ}} where δ = δ(d,ε), iii) λ(G) ≤ ε ⋅ d, for any lift size 𝓁 ≤ 2^{n^{δ₀}} for a fixed δ₀ > 0, when d ≥ d₀(ε), or iv) λ(G) ≤ Õ(√d), for lift size "exactly" 𝓁 = 2^{Θ(n)}. As corollaries, we obtain explicit quantum lifted product codes of Panteleev and Kalachev of almost linear distance (and also in a wide range of parameters) and explicit classical quasi-cyclic LDPC codes with wide range of circulant sizes. Items (i) and (ii) above are obtained by extending the techniques of Mohanty, O'Donnell and Paredes [STOC 2020] for 2-lifts to much larger abelian lift sizes (as a byproduct simplifying their construction). This is done by providing a new encoding of special walks arising in the trace power method, carefully "compressing" depth-first search traversals. Result (iii) is via a simpler proof of Agarwal et al. [SIAM J. Discrete Math 2019] at the expense of polylog factors in the expansion.
Cite as

Fernando Granha Jeronimo, Tushant Mittal, Ryan O'Donnell, Pedro Paredes, and Madhur Tulsiani. Explicit Abelian Lifts and Quantum LDPC Codes. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 88:1-88:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{jeronimo_et_al:LIPIcs.ITCS.2022.88,
  author =	{Jeronimo, Fernando Granha and Mittal, Tushant and O'Donnell, Ryan and Paredes, Pedro and Tulsiani, Madhur},
  title =	{{Explicit Abelian Lifts and Quantum LDPC Codes}},
  booktitle =	{13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
  pages =	{88:1--88:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-217-4},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{215},
  editor =	{Braverman, Mark},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.88},
  URN =		{urn:nbn:de:0030-drops-156846},
  doi =		{10.4230/LIPIcs.ITCS.2022.88},
  annote =	{Keywords: Graph lifts, expander graphs, quasi-cyclic LDPC codes, quantum LDPC codes}
}
Document
DOI: 10.4230/OASIcs.SLATE.2020.2
Detection of Vulnerabilities in Smart Contracts Specifications in Ethereum Platforms

Authors: Mauro C. Argañaraz, Mario M. Berón, Maria J. Varanda Pereira, and Pedro Rangel Henriques

Published in: OASIcs, Volume 83, 9th Symposium on Languages, Applications and Technologies (SLATE 2020)

Abstract
Ethereum is the principal ecosystem based on blockchain that provides a suitable environment for coding and executing smart contracts, which have been receiving great attention due to the commercial apps and among the scientific community. The process of writing secure and well performing contracts in the Ethereum platform is a major challenge for developers. It consists of the application of non-conventional programming paradigms due to the inherent characteristics of the execution of distributed computing programs. Furthermore, the errors in the deployed contracts could have serious consequences because of the immediate linkage between the contract code and the financial transactions. The direct handling of the assets means that the errors can be more relevant for security and have greater economic consequences than a mistake in the conventional apps. In this paper, we propose a tool for the detection of vulnerabilities in high-level languages based on automatized static analysis.
Cite as

Mauro C. Argañaraz, Mario M. Berón, Maria J. Varanda Pereira, and Pedro Rangel Henriques. Detection of Vulnerabilities in Smart Contracts Specifications in Ethereum Platforms. In 9th Symposium on Languages, Applications and Technologies (SLATE 2020). Open Access Series in Informatics (OASIcs), Volume 83, pp. 2:1-2:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{arganaraz_et_al:OASIcs.SLATE.2020.2,
  author =	{Arga\~{n}araz, Mauro C. and Ber\'{o}n, Mario M. and Varanda Pereira, Maria J. and Henriques, Pedro Rangel},
  title =	{{Detection of Vulnerabilities in Smart Contracts Specifications in Ethereum Platforms}},
  booktitle =	{9th Symposium on Languages, Applications and Technologies (SLATE 2020)},
  pages =	{2:1--2:16},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-165-8},
  ISSN =	{2190-6807},
  year =	{2020},
  volume =	{83},
  editor =	{Sim\~{o}es, Alberto and Henriques, Pedro Rangel and Queir\'{o}s, Ricardo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SLATE.2020.2},
  URN =		{urn:nbn:de:0030-drops-130154},
  doi =		{10.4230/OASIcs.SLATE.2020.2},
  annote =	{Keywords: blockchain, ethereum, smart contract, solidity, static analysis, verification}
}
Document
DOI: 10.4230/LIPIcs.SoCG.2017.17
Reachability in a Planar Subdivision with Direction Constraints

Authors: Daniel Binham, Pedro Machado Manhaes de Castro, and Antoine Vigneron

Published in: LIPIcs, Volume 77, 33rd International Symposium on Computational Geometry (SoCG 2017)

Abstract
Given a planar subdivision with n vertices, each face having a cone of possible directions of travel, our goal is to decide which vertices of the subdivision can be reached from a given starting point s. We give an O(n log n)-time algorithm for this problem, as well as an Omega(n log n) lower bound in the algebraic computation tree model. We prove that the generalization where two cones of directions per face are allowed is NP-hard.
Cite as

Daniel Binham, Pedro Machado Manhaes de Castro, and Antoine Vigneron. Reachability in a Planar Subdivision with Direction Constraints. In 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 77, pp. 17:1-17:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{binham_et_al:LIPIcs.SoCG.2017.17,
  author =	{Binham, Daniel and Manhaes de Castro, Pedro Machado and Vigneron, Antoine},
  title =	{{Reachability in a Planar Subdivision with Direction Constraints}},
  booktitle =	{33rd International Symposium on Computational Geometry (SoCG 2017)},
  pages =	{17:1--17:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-038-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{77},
  editor =	{Aronov, Boris and Katz, Matthew J.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.17},
  URN =		{urn:nbn:de:0030-drops-72022},
  doi =		{10.4230/LIPIcs.SoCG.2017.17},
  annote =	{Keywords: Design and analysis of geometric algorithms, Path planning, Reachability}
}
Document
DOI: 10.4230/OASIcs.SCOR.2014.25
Solving the p-median location problem with the Erlenkotter approach in public service system design

Authors: Ján Bendík

Published in: OASIcs, Volume 37, 4th Student Conference on Operational Research (2014)

Abstract
The problem can be often formulated as a weighted p-median problem. Real instances of the problem are characterized by big numbers of possible service center locations, which can take the value of several hundreds or thousands. The optimal solution can be obtained by the universal IP solvers only for smaller instances of the problem. The universal IP solvers are very time-consuming and often fail when solving a large instance. Our approach to the problem is based on the Erlenkotter procedure for solving of the uncapacitated facility location problem and on the Lagrangean relaxation of the constraint which limits number of the located center. The suggested approach finds the optimal solution in most of the studied instances. The quality and the feasibility of the resulting solutions of the suggested approach depend on the setting of the Lagrangean multiplier. A suitable value of the multiplier can be obtained by a bisection algorithm. The resulting multiplier cannot guarantee an optimal solution, but provides a near-to-optimal solution and a lower bound. If our approach does not obtain the optimal solution, then a heuristic improves the near-to-optimal solution. The resulting solution of our approach and the optimal solution obtained by the universal IP solver XPRESS-IVE are compared in the computational time and the quality of solutions.
Cite as

Ján Bendík. Solving the p-median location problem with the Erlenkotter approach in public service system design. In 4th Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 37, pp. 25-33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@InProceedings{bendik:OASIcs.SCOR.2014.25,
  author =	{Bend{\'\i}k, J\'{a}n},
  title =	{{Solving the p-median location problem with the Erlenkotter approach in public service system design}},
  booktitle =	{4th Student Conference on Operational Research},
  pages =	{25--33},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-67-5},
  ISSN =	{2190-6807},
  year =	{2014},
  volume =	{37},
  editor =	{Crespo Del Granado, Pedro and Joyce-Moniz, Martim and Ravizza, Stefan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2014.25},
  URN =		{urn:nbn:de:0030-drops-46676},
  doi =		{10.4230/OASIcs.SCOR.2014.25},
  annote =	{Keywords: p-median location problem, Erlenkotter's approach, Lagrangean relaxation}
}
Document
DOI: 10.4230/DagSemProc.06431.4
06431 Working Group Summary: Atomicity in Mobile Networks

Authors: Sebastian Obermeier, Joos-Hendrik Böse, Stefan Böttcher, Panos Kypros Chrysanthis, Alex Delis, Le Gruenwald, Anirban Mondal, Aris Ouksel, George Samaras, and Stratis Viglas

Published in: Dagstuhl Seminar Proceedings, Volume 6431, Scalable Data Management in Evolving Networks (2007)

Abstract
We introduce different mobile network applications and show to which degree the concept of database transactions is required within the applications. We show properties of transaction processing and explain which properties are important for each of the mobile applications. Furthermore, we discuss open questions regarding transaction processing in mobile networks and identify open problems for further research.
Cite as

Sebastian Obermeier, Joos-Hendrik Böse, Stefan Böttcher, Panos Kypros Chrysanthis, Alex Delis, Le Gruenwald, Anirban Mondal, Aris Ouksel, George Samaras, and Stratis Viglas. 06431 Working Group Summary: Atomicity in Mobile Networks. In Scalable Data Management in Evolving Networks. Dagstuhl Seminar Proceedings, Volume 6431, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{obermeier_et_al:DagSemProc.06431.4,
  author =	{Obermeier, Sebastian and B\"{o}se, Joos-Hendrik and B\"{o}ttcher, Stefan and Chrysanthis, Panos Kypros and Delis, Alex and Gruenwald, Le and Mondal, Anirban and Ouksel, Aris and Samaras, George and Viglas, Stratis},
  title =	{{06431 Working Group Summary: Atomicity in Mobile Networks}},
  booktitle =	{Scalable Data Management in Evolving Networks},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6431},
  editor =	{Stefan B\"{o}ttcher and Le Gruenwald and Pedro Jose Marr\'{o}n and Evaggelia Pitoura},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06431.4},
  URN =		{urn:nbn:de:0030-drops-9521},
  doi =		{10.4230/DagSemProc.06431.4},
  annote =	{Keywords: Mobile ad noc networks, mobile databases, mobile transactions, atomicity}
}
Document
DOI: 10.4230/DagSemProc.06431.5
06431 Working Group Summary: P2P, Ad Hoc and Sensor Networks – All the Different or All the Same?

Authors: Peter A. Boncz, Angela Bonifati, Joos-Hendrik Böse, Stefan Böttcher, Panos Kypros Chrysanthis, Le Gruenwald, Arantza Illarramendi, Peter Janacik, Birgitta König-Ries, Wolfgang May, Anirban Mondal, Sebastian Obermeier, Aris Ouksel, and George Samaras

Published in: Dagstuhl Seminar Proceedings, Volume 6431, Scalable Data Management in Evolving Networks (2007)

Abstract
Currently, data management technologies are in the process of finding their way into evolving networks, i.e. P2P, ad hoc and wireless sensor networks. We examine the properties, differences and commonalities of the different types of evolving networks, in order to enable the development of adequate technologies suiting their characteristics. We start with presenting definitions for the different network types, before arranging them in a network hierarchy, to gain a clear view of the area. Then, we analyze and compare the example applications for each of the types using different design dimensions. Based on this work, we finally present a comparison of P2P, ad hoc and wireless sensor networks.
Cite as

Peter A. Boncz, Angela Bonifati, Joos-Hendrik Böse, Stefan Böttcher, Panos Kypros Chrysanthis, Le Gruenwald, Arantza Illarramendi, Peter Janacik, Birgitta König-Ries, Wolfgang May, Anirban Mondal, Sebastian Obermeier, Aris Ouksel, and George Samaras. 06431 Working Group Summary: P2P, Ad Hoc and Sensor Networks – All the Different or All the Same?. In Scalable Data Management in Evolving Networks. Dagstuhl Seminar Proceedings, Volume 6431, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{boncz_et_al:DagSemProc.06431.5,
  author =	{Boncz, Peter A. and Bonifati, Angela and B\"{o}se, Joos-Hendrik and B\"{o}ttcher, Stefan and Chrysanthis, Panos Kypros and Gruenwald, Le and Illarramendi, Arantza and Janacik, Peter and K\"{o}nig-Ries, Birgitta and May, Wolfgang and Mondal, Anirban and Obermeier, Sebastian and Ouksel, Aris and Samaras, George},
  title =	{{06431 Working Group Summary: P2P, Ad Hoc and Sensor Networks – All the Different or All the Same?}},
  booktitle =	{Scalable Data Management in Evolving Networks},
  pages =	{1--7},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{6431},
  editor =	{Stefan B\"{o}ttcher and Le Gruenwald and Pedro Jose Marr\'{o}n and Evaggelia Pitoura},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06431.5},
  URN =		{urn:nbn:de:0030-drops-9514},
  doi =		{10.4230/DagSemProc.06431.5},
  annote =	{Keywords: P2P, ad hoc, wireless sensor networks, database systems}
}
Document
DOI: 10.4230/DagSemProc.04441.3
04441 Working Group - Some Open Aspects of Mobile Ad-hoc NETwork, Peer-to-Peer, and Self-organizing Systems

Authors: Joos-Hendrik Böse, Stefan Böttcher, Le Gruenwald, Pedro Jóse Marrón, Philipp Obreiter, Evaggelia Pitoura, Peter Reiher, Kai-Uwe Sattler, and Frank Seliger

Published in: Dagstuhl Seminar Proceedings, Volume 4441, Mobile Information Management (2005)

Abstract
This document summarizes the results of the working group discussion on Mobile Ad-hoc NETworks (MANETs), peer-to-peer (p2p) and self-organizing systems held at the workshop on Mobile Information Management in October 2
Cite as

Joos-Hendrik Böse, Stefan Böttcher, Le Gruenwald, Pedro Jóse Marrón, Philipp Obreiter, Evaggelia Pitoura, Peter Reiher, Kai-Uwe Sattler, and Frank Seliger. 04441 Working Group - Some Open Aspects of Mobile Ad-hoc NETwork, Peer-to-Peer, and Self-organizing Systems. In Mobile Information Management. Dagstuhl Seminar Proceedings, Volume 4441, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{bose_et_al:DagSemProc.04441.3,
  author =	{B\"{o}se, Joos-Hendrik and B\"{o}ttcher, Stefan and Gruenwald, Le and Marr\'{o}n, Pedro J\'{o}se and Obreiter, Philipp and Pitoura, Evaggelia and Reiher, Peter and Sattler, Kai-Uwe and Seliger, Frank},
  title =	{{04441 Working Group - Some Open Aspects of Mobile Ad-hoc NETwork, Peer-to-Peer, and Self-organizing Systems}},
  booktitle =	{Mobile Information Management},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4441},
  editor =	{Margaret H. Dunham and Birgitta K\"{o}nig-Ries and Evaggelia Pitoura and Peter Reiher and Can T\"{u}rker},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04441.3},
  URN =		{urn:nbn:de:0030-drops-2171},
  doi =		{10.4230/DagSemProc.04441.3},
  annote =	{Keywords: MANET, P2P}
}
  • Refine by Author
  • 3 Böse, Joos-Hendrik
  • 3 Böttcher, Stefan
  • 3 Gruenwald, Le
  • 2 Chrysanthis, Panos Kypros
  • 2 Henriques, Pedro Rangel
  • Show More...

  • Refine by Classification
  • 1 Security and privacy → Vulnerability scanners
  • 1 Software and its engineering → Formal language definitions
  • 1 Software and its engineering → Language types
  • 1 Theory of computation → Distributed algorithms
  • 1 Theory of computation → Expander graphs and randomness extractors
  • Show More...

  • Refine by Keyword
  • 2 P2P
  • 1 Broadcast Congested Clique
  • 1 CONGEST
  • 1 Design and analysis of geometric algorithms
  • 1 Erlenkotter's approach
  • Show More...

  • Refine by Type
  • 9 document

  • Refine by Publication Year
  • 2 2007
  • 2 2023
  • 1 2005
  • 1 2014
  • 1 2017
  • Show More...

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact