Dissertations / Theses on the topic 'Distributed systems and algorithms'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Distributed systems and algorithms.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Pandit, Saurav. "Approximation algorithms for distributed systems." Diss., University of Iowa, 2010. https://ir.uiowa.edu/etd/870.
Full textBernabéu-Aubán, José Manuel. "Location finding algorithms for distributed systems." Diss., Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/32951.
Full textCornejo, Collado Alejandro. "Local distributed algorithms for multi-robot systems." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/79220.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (p. 165-173) and index.
The field of swarm robotics focuses on controlling large populations of simple robots to accomplish tasks more effectively than what is possible using a single robot. This thesis develops distributed algorithms tailored for multi-robot systems with large populations. Specifically we focus on local distributed algorithms since their performance depends primarily on local parameters on the system and are guaranteed to scale with the number of robots in the system. The first part of this thesis considers and solves the problem of finding a trajectory for each robot which is guaranteed to preserve the connectivity of the communication graph, and when feasible it also guarantees the robots advanced towards a goal defined by an arbitrary motion planner. We also describe how to extend our proposed approach to preserve the k-connectivity of a communication graph. Finally, we show how our connectivity-preserving algorithm can be combined with standard averaging procedures to yield a provably correct flocking algorithm. The second part of this thesis considers and solves the problem of having each robot localize an arbitrary subset of robots in a multi-robot system relying only on sensors at each robot that measure the angle, relative to the orientation of each robot, towards neighboring robots in the communication graph. We propose a distributed localization algorithm that computes the relative orientations and relative positions, up to scale, of an arbitrary subset of robots. For the case when the robots move in between rounds we show how to use odometry information to allow each robot to compute the relative positions complete with scale, of an arbitrary subset of robots. Finally we describe how to use the our localization algorithm to design a variety of multi-robot tasks.
by Alejandro Cornejo.
Ph.D.
Saia, Jared. "Algorithms for managing data in distributed systems /." Thesis, Connect to this title online; UW restricted, 2002. http://hdl.handle.net/1773/6941.
Full textWilhelm, Daniel. "Ordered broadcast algorithms in dynamic distributed systems." Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS135.
Full textCausal broadcast is a fundamental building block of many distributed and parallel applications, where processes collaborate to perform common tasks, such as high performance computing, distributed databases, conferencing, social networks or other services providing a service to many users. In such systems, processes often require a broadcast primitive to share information that must be ordered to be meaningful, and causal order has been proven to be the strongest order that can be implemented in systems where partitioning can occur. Existing causal broadcast algorithms are either not scalable or they do not tolerate all the dynamics introduced by processes that join and leave the system or fail during execution. Some works append on messages all the information required to causally order them at destination. However, it has been proved that a structure with one entry per process in the system is the minimal structure required to ensure the causal delivery of broadcast messages. Hence, algorithms that append all the causal information on messages do not scale. Some other works make assumptions on the system, such as the network topology or the FIFO property of the communication channels. Such works do not handle well the dynamics caused by processes that join and leave the system or fail. Hence, these works do not handle all the possible dynamics of distributed systems. In this thesis, we provide causal broadcast algorithms that do scale and tolerate the dynamics of distributed systems. We first provide causal broadcast algorithms for Mobile Networks. Such networks have specific features: limited capacities of nodes (computation, storage, energy), unreliable communication channels, and the dynamics of connections due to node mobility, node failure, and join/leave operations of nodes. In the second part, we address causal broadcast provided with constant size clocks. Constant size clocks tolerate process churn and have a size that does not depend on the number of processes. However, they do not characterize causality and algorithms using them only ensure causal order probabilistically. We first propose an error detector, based on hashes, which analyzes the constant size clocks of messages before delivering them in order to detect messages which have causal dependencies that the process did not deliver yet. Second, we propose an algorithm to retrieve the causal dependencies of messages, which we use to ensure the causal delivery of messages tagged by the error detector. Third, we propose a new clock build with constant size clocks and which adapts its size to the number of concurrent messages inside the system. We implemented the contributions on the OMNeT++ simulator. Both causal broadcast algorithms were implemented on the framework INET, which is a realistic network simulator implementing interferences on the wireless network, network layers and node mobility among others. Results confirm that the presented causal broadcast algorithms outperform existing algorithms done for Mobile Networks while making realistic network assumptions. The contributions to constant size clocks were implemented on the OMNeT++ simulator. Results show that the hash-based error detector detected all messages whose causal dependencies have not been delivered yet. Combining the hash-based error detector with the algorithm to retrieve the causal dependencies of messages allowed to deliver all messages in causal order. We analyzed the limits of the hash-based error detector and the retrieval of causal dependencies. Finally, results show that the proposed clock adapts itself well to the number of concurrent messages inside the system
Huq, Sikder Rezwanul. "Locally self-adjusting distributed algorithms." Diss., University of Iowa, 2018. https://ir.uiowa.edu/etd/6594.
Full textGhodsi, Ali. "Distributed k-ary System: Algorithms for Distributed Hash Tables." Doctoral thesis, KTH, Mikroelektronik och Informationsteknik, IMIT, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4186.
Full textQC 20100824
AGATE, Vincenzo. "REPUTATION MANAGEMENT ALGORITHMS IN DISTRIBUTED APPLICATIONS." Doctoral thesis, Università degli Studi di Palermo, 2020. http://hdl.handle.net/10447/395198.
Full textObrovac, Marko. "Chemical Computing for Distributed Systems: Algorithms and Implementation." Phd thesis, Université Rennes 1, 2013. http://tel.archives-ouvertes.fr/tel-00925257.
Full textDivi, Vijay 1980. "Estimation and calibration algorithms for distributed sampling systems." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45874.
Full textIncludes bibliographical references (p. 153-157).
Traditionally, the sampling of a signal is performed using a single component such as an analog-to-digital converter. However, many new technologies are motivating the use of multiple sampling components to capture a signal. In some cases such as sensor networks, multiple components are naturally found in the physical layout; while in other cases like time-interleaved analog-to-digital converters, additional components are added to increase the sampling rate. Although distributing the sampling load across multiple channels can provide large benefits in terms of speed, power, and resolution, a variety mismatch errors arise that require calibration in order to prevent a. degradation in system performance.In this thesis, we develop low-complexity, blind algorithms for the calibration of distributed sampling systems. In particular, we focus on recovery from timing skews that cause deviations from uniform timing. Methods for bandlimited input reconstruction from nonuniform recurrent samples are presented for both the small-mismatch and the low-SNR domains. Alternate iterative reconstruction methods are developed to give insight into the geometry of the problem.From these reconstruction methods, we develop time-skew estimation algorithms that have high performance and low complexity even for large numbers of components. We also extend these algorithms to compensate for gain mismatch between sampling components. To understand the feasibility of implementation, analysis is also presented for a sequential implementation of the estimation algorithm.In distributed sampling systems, the minimum input reconstruction error is dependent upon the number of sampling components as well as the sample times of the components. We develop bounds on the expected reconstruction error when the time-skews are distributed uniformly.
(cont) Performance is compared to systems where input measurements are made via projections onto random bases, an alternative to the sinc basis of time-domain sampling. From these results, we provide a framework on which to compare the effectiveness of any calibration algorithm.Finally, we address the topic of extreme oversampling, which pertains to systems with large amounts of oversampling due to redundant sampling components. Calibration algorithms are developed for ordering the components and for estimating the input from ordered components. The algorithms exploit the extra samples in the system to increase estimation performance and decrease computational complexity.
by Vijay Divi.
Ph.D.
To, Toan. "Distributed opportunistic scheduling algorithms for wireless communications." Thesis, Swansea University, 2012. https://cronfa.swan.ac.uk/Record/cronfa42588.
Full textTorres-Rojas, Francisco Jose. "Efficient time representation in distributed systems." Thesis, Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/8301.
Full textAbou, Jaoude Dany. "Computationally Driven Algorithms for Distributed Control of Complex Systems." Diss., Virginia Tech, 2018. http://hdl.handle.net/10919/85965.
Full textPh. D.
The work in this dissertation is motivated by the numerous applications in which multiple agents interact and cooperate to perform a coordinated task. Examples of such applications include automated highway systems and formation flight of unmanned aircraft systems. For instance, one can think of the hazardous conditions created by a fire in a building and the benefits of using multiple interacting multirotors to deal with this emergency situation and reduce the risks on humans. This dissertation develops mathematical tools for studying and dealing with these complex systems. Namely, it is shown how controllers can be designed to ensure that such systems perform in the desired way, and how the models that describe the systems of interest can be systematically simplified to facilitate performing the tasks of mathematical analysis and control design.
Benmohammed-Mahieddine, Kouider. "An evaluation of load balancing algorithms for distributed systems." Thesis, University of Leeds, 1991. http://etheses.whiterose.ac.uk/4395/.
Full textChua, Kee Koon 1965. "Deadlock avoidance: Improved algorithms for centralized and distributed systems." Thesis, The University of Arizona, 1992. http://hdl.handle.net/10150/291335.
Full textNanongkai, Danupon. "Graph and geometric algorithms on distributed networks and databases." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/41056.
Full textKolesnikov, Valeriy. "InDiGo : an infrastructure for optimization of distributed algorithms." Diss., Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/1007.
Full textChong, Kheng Huat. "Dynamic routing algorithms for distributed packet-switched data networks." Thesis, Imperial College London, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.391256.
Full textWong, Wing-ki Vicky. "An immunity-based distributed multiagent control framework." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B37314348.
Full textSun, Qiong, and 孙琼. "Topology-transparent distributed scheduling in wireless networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B44904101.
Full textMfoumboulou, Yohan Darcy. "Development of nonlinear control algorithms for implementation in distributed systems." Thesis, Cape Peninsula University of Technology, 2014. http://hdl.handle.net/20.500.11838/1187.
Full textIn the past decade, the need for flexibility and reconfigurability in automation has contributed to the rise of the distributed concept in control systems engineering. The IEC 61499 standard is used to define a distributed model for dividing various components of an industrial application in automation process and complicated control of machinery into function blocks. Such function blocks have the flexibility to be distributed and interconnected across a number of controllers. However, this new standard for automation faces two main challenges: the complexity in designs of distributed systems and the lack of utilization of the standard in industry. Most applications of controllers based on functional block programming are for linear systems. As most of industrial processes are nonlinear there is a need to extend the functional block approach for implementation of nonlinear controllers. Design complexity involves the exact modeling of the system in function blocks to obtain its accurate behaviour and the lack of utilization of the standard is understandable because new technologies are not easily accepted in industry due to their high prices and risks of compromising the performance at the production level. The thesis describes a methodology for design and implementation of nonlinear controllers for nonlinear plants in IEC 61499 standard compliant real-time environment of TwinCAT 3 and Beckhoff Programmable Logic Controller (PLC). The first step is to design the nonlinear controllers and simulate the closed-loop system in MATLAB/SIMULINK software. Then the new engineering based concepts to transform the obtained closed-loop system model to an IEC 61499 Function Block Model. This is accomplished by applying one method which involves a complete model transformation between two block-diagram languages: Simulink and TwinCAT 3. The development tools that support the transformation algorithm in the thesis sets the foundation stone of the verification and validation structure for IEC 61499 function blocks approach. The transformed model of the closed-loop system is downloaded to the Beckhoff PLC and is simulated in real-time. The obtained results demonstrate that the developed methodology allows complex nonlinear controllers to be successfully transformed to IEC 61499 standard compliant environment and to be applied for real-time PLC control of complex plants.
Ezhilchelvan, Paul Davadoss. "Design and development of algorithms for fault tolerant distributed systems." Thesis, University of Newcastle Upon Tyne, 1989. http://hdl.handle.net/10443/2069.
Full textMcLurkin, James D. (James Dwight) 1972. "Analysis and implementation of distributed algorithms for multi-robot systems." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44716.
Full textIncludes bibliographical references (p. 159-166).
Distributed algorithms for multi-robot systems rely on network communications to share information. However, the motion of the robots changes the network topology, which affects the information presented to the algorithm. For an algorithm to produce accurate output, robots need to communicate rapidly enough to keep the network topology correlated to their physical configuration. Infrequent communications will cause most multirobot distributed algorithms to produce less accurate results, and cause some algorithms to stop working altogether. The central theme of this work is that algorithm accuracy, communications bandwidth, and physical robot speed are related. This thesis has three main contributions: First, I develop a prototypical multi-robot application and computational model, propose a set of complexity metrics to evaluate distributed algorithm performance on multi-robot systems, and introduce the idea of the robot speed ratio, a dimensionless measure of robot speed relative to message speed in networks that rely on multi-hop communication. The robot speed ratio captures key relationships between communications bandwidth, mobility, and algorithm accuracy, and can be used at design time to trade off between them. I use this speed ratio to evaluate the performance of existing distributed algorithms for multi-hop communication and navigation. Second, I present a definition of boundaries in multi-robot systems, and develop new distributed algorithms to detect and characterize them. Finally, I define the problem of dynamic task assignment, and present four distributed algorithms that solve this problem, each representing a different trade-off between accuracy, running time, and communication resources. All the algorithms presented in this work are provably correct under ideal conditions and produce verifiable real-world performance.
(cont.) They are self-stabilizing and robust to communications failures, population changes, and other errors. All the algorithms were tested on a swarm of 112 robots.
by James Dwight McLurkin, IV.
Ph.D.
Jeong, Dong Hwa. "DISTRIBUTED WIRELESS SENSOR NETWORK SYSTEMS: THEORETICAL FRAMEWORK, ALGORITHMS, AND APPLICATIONS." Case Western Reserve University School of Graduate Studies / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=case1436541959.
Full textChang, Ye-In. "Design and analysis of mutual exclusion algorithms for distributed systems /." The Ohio State University, 1991. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487687959967532.
Full textJohnson, Ian D. "A study of adaptive load balancing algorithms for distributed systems." Thesis, Aston University, 1988. http://publications.aston.ac.uk/10660/.
Full textLeslie, Robert. "An evaluation of load sharing algorithms for heterogeneous distributed systems." Thesis, University of Greenwich, 1997. http://gala.gre.ac.uk/6224/.
Full textBhola, Sumeer Kumar. "Replication in interactive distributed applications : abstractions, algorithms and evaluation." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/8138.
Full textKassabalidis, Ioannis N. "Applications of biologically inspired algorithms to complex systems /." Thesis, Connect to this title online; UW restricted, 2002. http://hdl.handle.net/1773/5915.
Full textDeorukhkar, Mayuresh. "Deadlock probability prediction and detection in distributed systems /." free to MU campus, to others for purchase, 2004. http://wwwlib.umi.com/cr/mo/fullcit?p1421130.
Full textBogdanov, Kirill. "Reducing Long Tail Latencies in Geo-Distributed Systems." Licentiate thesis, KTH, Network Systems Laboratory (NS Lab), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-194729.
Full textDatabehandlingstjänster är en välintegrerad del av det moderna samhället. Miljontals människor förlitar sig dagligen på dessa tjänster för kommunikation, samordning, handel, och åtkomst till information. För att möta höga krav implementeras och placeras många populära tjänster som geo-fördelning applikationer ovanpå tredje parters virtuella molntjänster. Det ligger emellertid i sakens natur att sådana utplaceringar resulterar i varierande prestanda. För att leverera höga servicekvalitetskrav behöver sådana system sträva efter att ständigt anpassa sig efter ändrade förutsättningar genom att övervaka tillståndsändringar och ta realtidsbeslut, som till exempel val av server peering, replika placering, och val av kvorum. Den här avhandlingen avser att förbättra kvaliteten på realtidsbeslut tagna av geo-fördelning system. Detta kan uppnås genom: (1) en bättre förståelse av underliggande utplaceringsvillkor, (2) systematisk och noggrann testning av beslutslogik redan implementerad i dessa system, och (3) en tydlig inblick i nätverket och systemtillstånd som tillåter dessa tjänster att utföra mer informerade beslut. Vi utförde en långsiktig korsa datacenter latensmätning av Amazons EC2 molntjänst. Mätdata användes sedan till att kvantifiera variationen av nätverkstillstånd och demonstrera dess inverkan på prestanda för system placerade ovanpå denna molntjänst. Därnäst validerades en applikations beslutslogik vanlig i populära lagringssystem genom att undersöka replika valalgoritmen. GeoPerf, ett verktyg som tillämpar symbolisk exekvering och lättviktsmodellering för systematisk testning av replika valalgoritmen, användes för att testa två populära lagringssystem och vi hittade en bugg i båda. Genom traceroute och envägslatensmätningar över EC2 demonstrerar vi ihängande korrelation mellan nätverksvägar och nätverkslatens. Vi introducerar också EdgeVar, ett verktyg som frikopplar dirigering och trängsel baserat på förändringar i nätverkslatens. Genom att tillhandahålla denna ytterligare information förbättrade vi kvaliteten på latensuppskattningen och stabiliteten på nätverkets val av väg. Slutligen introducerade vi Tectonic, ett verktyg som följer en applikations begäran och gensvar på både användare-läge och kernel-läge. Tillsammans med EdgeVar förses en komplett bild av fördröjningar associerade med varje beräkningssteg av begäran och gensvar. Med Tectonic kunde vi analysera inverkan av att dela CPUer i en virtuell miljö och kan avslöja hypervisor schemaläggningsprinciper. Vi argumenterar för betydelsen av att känna till dessa principer och föreslå användningen av de i beslutsprocessen.
QC 20161101
Wong, Wing-ki Vicky, and 黃穎琪. "An immunity-based distributed multiagent control framework." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B37314348.
Full textLenharth, Andrew. "Algorithms for Stable Allocations in Distributed Real-Time Resource Management Systems." Ohio University / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1102697777.
Full textLenharth, Andrew D. "Algorithms for stable allocations in distributed real-time resource management systems." Ohio : Ohio University, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1102697777.
Full textCheung, Victor. "Distributed position estimation for wireless sensor networks /." View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?COMP%202006%20CHEUNG.
Full textLu, Yapeng. "An integrated algorithm for distributed optimization in networked systems." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B43224234.
Full textJones, Malachi Gabriel. "Design and implementation of a multi-agent systems laboratory." Thesis, Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29617.
Full textCommittee Chair: Jeff Shamma; Committee Member: Eric Feron; Committee Member: Magnus Egerstedt. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Bhattacharya, Shaondip. "Multi-agent System Distributed Sensor Fusion Algorithms." Thesis, Luleå tekniska universitet, Rymdteknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-65839.
Full textLu, Yapeng, and 呂亞鵬. "An integrated algorithm for distributed optimization in networked systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43224234.
Full textGujrati, Sumeet. "Models and algorithms for cyber-physical systems." Diss., Kansas State University, 2013. http://hdl.handle.net/2097/16922.
Full textDepartment of Computing and Information Sciences
Gurdip Singh
In this dissertation, we propose a cyber-physical system model, and based on this model, present algorithms for a set of distributed computing problems. Our model specifies a cyber-physical system as a combination of cyber-infrastructure, physical-infrastructure, and user behavior specification. The cyber-infrastructure is superimposed on the physical-infrastructure and continuously monitors its (physical-infrastructure's) changing state. Users operate in the physical-infrastructure and interact with the cyber-infrastructure using hand-held devices and sensors; and their behavior is specified in terms of actions they can perform (e.g., move, observe). While in traditional distributed systems, users interact solely via the underlying cyber-infrastructure, users in a cyber-physical system may interact directly with one another, access sensor data directly, and perform actions asynchronously with respect to the underlying cyber-infrastructure. These additional types of interactions have an impact on how distributed algorithms for cyber-physical systems are designed. We augment distributed mutual exclusion and predicate detection algorithms so that they can accommodate user behavior, interactions among them and the physical-infrastructure. The new algorithms have two components - one describing the behavior of the users in the physical-infrastructure and the other describing the algorithms in the cyber-infrastructure. Each combination of users' behavior and an algorithm in the cyber-infrastructure yields a different cyber-physical system algorithm. We have performed extensive simulation study of our algorithms using OMNeT++ simulation engine and Uppaal model checker. We also propose Cyber-Physical System Modeling Language (CPSML) to specify cyber-physical systems, and a centralized global state recording algorithm.
Qi, Dehu. "Multi-agent systems : integrating reinforcement learning, bidding and genetic algorithms /." free to MU campus, to others for purchase, 2002. http://wwwlib.umi.com/cr/mo/fullcit?p3060133.
Full textGubba, Ravikumar Krishnanjan. "Distributed simulation of power systems using real time digital simulator." Master's thesis, Mississippi State : Mississippi State University, 2009. http://library.msstate.edu/etd/show.asp?etd=etd-06152009-222641.
Full textZhuo, Ling, and 卓玲. "Document replication and distribution algorithms for load balancing ingeographically distributed web server systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B31228148.
Full textStrothmann, Thim Frederik [Verfasser]. "Self-* Algorithms for distributed systems : programmable matter & overlay networks / Thim Frederik Strothmann." Paderborn : Universitätsbibliothek, 2017. http://d-nb.info/1137554843/34.
Full textJiang, Qiangfeng. "ALGORITHMS FOR FAULT TOLERANCE IN DISTRIBUTED SYSTEMS AND ROUTING IN AD HOC NETWORKS." UKnowledge, 2013. http://uknowledge.uky.edu/cs_etds/16.
Full textKhan, Md Mosaddek. "Speeding up GDL-based distributed constraint optimization algorithms in cooperative multi-agent systems." Thesis, University of Southampton, 2018. https://eprints.soton.ac.uk/421047/.
Full textSagha, Hossein. "Development of innovative robust stability enhancement algorithms for distribution systems containing distributed generators." Thesis, Queensland University of Technology, 2015. https://eprints.qut.edu.au/91052/1/Hossein_Sagha_Thesis.pdf.
Full textYu, Han. "PLANNING AND SCHEDULING FOR LARGE-SCALEDISTRIBUTED SYSTEMS." Doctoral diss., University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4186.
Full textPh.D.
School of Computer Science
Engineering and Computer Science
Computer Science
Yu, Dongxiao, and 于东晓. "Distributed algorithmic studies in wireless ad hoc networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/206656.
Full textpublished_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
Ştefănescu, Alin. "Automatic synthesis of distributed transition systems." [S.l. : s.n.], 2006. http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-25606.
Full text