Einloggen

Thematische Bibliographien / Data structures (Computer science) / Dissertationen

Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: Data structures (Computer science).

Dissertationen zum Thema „Data structures (Computer science)“

Autor: Grafiati

Veröffentlicht am 4. Juni 2021

Zuletzt aktualisiert am 31. Juli 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit Top-50 Dissertationen für die Forschung zum Thema "Data structures (Computer science)" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Sehen Sie die Dissertationen für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.

1

Obiedat, Mohammad. "Incrementally Sorted Lattice Data Structures." Thesis, The George Washington University, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3732474.

Der volle Inhalt der Quelle

Annotation:

<p> Data structures are vital entities that strongly impact the efficiency of several software applications. Compactness, predictable memory access patterns, and good temporal and spacial locality of the structure's operations are increasingly becoming essential factors in the selection of a data structure for a specific application. In general, the less data we store and move the better for efficiency and power consumption, especially in infrastructure software and applications for hand-held devices like smartphones. In this dissertation, we extensively study a data structure named latt

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Kabiri, Chimeh Mozhgan. "Data structures for SIMD logic simulation." Thesis, University of Glasgow, 2016. http://theses.gla.ac.uk/7521/.

Der volle Inhalt der Quelle

Annotation:

Due to the growth of design size and complexity, design verification is an important aspect of the Logic Circuit development process. The purpose of verification is to validate that the design meets the system requirements and specification. This is done by either functional or formal verification. The most popular approach to functional verification is the use of simulation based techniques. Using models to replicate the behaviour of an actual system is called simulation. In this thesis, a software/data structure architecture without explicit locks is proposed to accelerate logic gate circuit

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Eastep, Jonathan M. (Jonathan Michael). "Smart data structures : an online machine learning approach to multicore data structures." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/65967.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student submitted PDF version of thesis.<br>Includes bibliographical references (p. 175-180).<br>As multicores become prevalent, the complexity of programming is skyrocketing. One major difficulty is eciently orchestrating collaboration among threads through shared data structures. Unfortunately, choosing and hand-

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Butts, Robert O. "Heterogeneous construction of spatial data structures." Thesis, University of Colorado at Denver, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1588178.

Der volle Inhalt der Quelle

Annotation:

<p> Linear spatial trees are typically constructed in two discrete, consecutive stages: calculating location codes, and sorting the spatial data according to the codes. Additionally, a GPU R-tree construction algorithm exists which likewise consists of sorting the spatial data and calculating nodes' bounding boxes. Current GPUs are approximately three orders of magnitude faster than CPUs for perfectly vectorizable problems. However, the best known GPU sorting algorithms only achieve 10-20 times speedup over sequential CPU algorithms. Both calculating location codes and bounding boxes are perfe

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Toussaint, Richard. "Data structures and operations for geographical information." Thesis, McGill University, 1995. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=23945.

Der volle Inhalt der Quelle

Annotation:

The topic of this thesis revolves around the organization of geographical information in permanent memory. Our premise is that a recognized and fully documented direct access storage technique called Multidimensional Paging or Multipaging would provide a well balanced storing structure for this category of data. Since multipaging uses a multidimensional perspective on the information to allocate it to pages in secondary storage then spatial data, which is fundamentally multidimensional by nature, would surely offer a suitable profile.<br>First, we attempt to evaluate the efficiency of multipag

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Eid, Ashraf. "Efficient associative data structures for bitemporal databases." Thesis, University of Ottawa (Canada), 2002. http://hdl.handle.net/10393/6226.

Der volle Inhalt der Quelle

Annotation:

Most applications require storing multiple versions of data and involve a lot of temporal semantics in their schema. This requires maintenance and querying of temporal relations. A Bitemporal DBMS will simplify the development and maintenance of such applications by moving temporal support from the application into the DBMS engine. The success of such Bitemporal DBMSs relies mainly on the availability of high performance indices that handle update and search operations efficiently. A successful associative data structure (index) is the one that can efficiently partition the space of the attrib

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Zhu, Yingchun 1968. "Optimizing parallel programs with dynamic data structures." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=36745.

Der volle Inhalt der Quelle

Annotation:

Distributed memory parallel architectures support a memory model where some memory accesses are local, and thus inexpensive, while other memory accesses are remote, and potentially quite expensive. In order to achieve efficiency on such architectures, we need to reduce remote accesses. This is particularly challenging for applications that use dynamic data structures.<br>In this thesis, I present two compiler techniques to reduce the overhead of remote memory accesses for dynamic data structure based applications: locality techniques and communication optimizations. Locality techniques include

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Karras, Panagiotis. "Data structures and algorithms for data representation in constrained environments." Thesis, Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/hkuto/record/B38897647.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Jain, Jhilmil Cross James H. "User experience design and experimental evaluation of extensible and dynamic viewers for data structures." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2006%20Fall/Dissertations/JAIN_JHILMIL_3.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Pǎtraşcu, Mihai. "Lower bound techniques for data structures." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/45866.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.<br>Includes bibliographical references (p. 135-143).<br>We describe new techniques for proving lower bounds on data-structure problems, with the following broad consequences: * the first [omega](lg n) lower bound for any dynamic problem, improving on a bound that had been standing since 1989; * for static data structures, the first separation between linear and polynomial space. Specifically, for some problems that have constant query time when polynomial space is allowed, we can

APA, Harvard, Vancouver, ISO und andere Zitierweisen

11

Ohashi, Darin. "Cache Oblivious Data Structures." Thesis, University of Waterloo, 2001. http://hdl.handle.net/10012/1060.

Der volle Inhalt der Quelle

Annotation:

This thesis discusses cache oblivious data structures. These are structures which have good caching characteristics without knowing Z, the size of the cache, or L, the length of a cache line. Since the structures do not require these details for good performance they are portable across caching systems. Another advantage of such structures isthat the caching results hold for every level of cache within a multilevel cache. Two simple data structures are studied; the array used for binary search and the linear list. As well as being cache oblivious, the structures presented in this

APA, Harvard, Vancouver, ISO und andere Zitierweisen

12

Curtis, Ronald Sanger. "Data structure complexity metrics." Buffalo, N.Y. : Dept. of Computer Science, State University of New York at Buffalo, 1994. http://www.cse.buffalo.edu/tech%2Dreports/94%2D39.ps.Z.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

13

Kuper, Lindsey. "Lattice-based data structures for deterministic parallel and distributed programming." Thesis, Indiana University, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3726443.

Der volle Inhalt der Quelle

Annotation:

<p> Deterministic-by-construction parallel programming models guarantee that programs have the same observable behavior on every run, promising freedom from bugs caused by schedule nondeterminism. To make that guarantee, though, they must sharply restrict sharing of state between parallel tasks, usually either by disallowing sharing entirely or by restricting it to one type of data structure, such as single-assignment locations.</p><p> I show that <i>lattice-based</i> data structures, or <i> LVars,</i> are the foundation for a guaranteed-deterministic parallel programming model that allows a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

14

Miner, andrew S. "Data structures for the analysis of large structured Markov models." W&M ScholarWorks, 2000. https://scholarworks.wm.edu/etd/1539623985.

Der volle Inhalt der Quelle

Annotation:

High-level modeling formalisms are increasingly popular tools for studying complex systems. Given a high-level model, we can automatically verify certain system properties or compute performance measures about the system. In the general case, measures must be computed using discrete-event simulations. In certain cases, exact numerical analysis is possible by constructing and analyzing the underlying stochastic process of the system, which is a continuous-time Markov chain (CTMC) in our case. Unfortunately, the number of states in the underlying CTMC can be extremely large, even if the high-lev

APA, Harvard, Vancouver, ISO und andere Zitierweisen

15

Chen, Jiawen (Jiawen Kevin). "Efficient data structures for piecewise-smooth video processing." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/66003.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 95-102).<br>A number of useful image and video processing techniques, ranging from low level operations such as denoising and detail enhancement to higher level methods such as object manipulation and special effects, rely on piecewise-smooth functions computed from the input data. In this thesis, we present two computationally efficient data structures for representing piecewise-smooth visual inf

APA, Harvard, Vancouver, ISO und andere Zitierweisen

16

Goudjil, Amar. "Data structures, binary search trees : a study of random Weyl trees." Thesis, McGill University, 1998. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=21559.

Der volle Inhalt der Quelle

Annotation:

This thesis covers the study of a particular class of binary search trees, the Weyl trees formed by consecutive insertion of numbers {theta}, {2theta}, {3theta}, ..., where theta is an irrational number from (0,1), and {x} denotes the fractional part of x. Various properties of the structure of these trees are explored and a relationship with the continued fraction expansion of theta is shown. Among these properties, an approximation of the height Hn of a Weyl tree with n nodes is given when theta is chosen at random and uniformly on (0, 1). The main result of this work is that in probability,

APA, Harvard, Vancouver, ISO und andere Zitierweisen

17

Costa, Andre. "Analytic modelling of agent-based network routing algorithms." Title page, contents and abstract only, 2002. http://web4.library.adelaide.edu.au/theses/09PH/09phc8373.pdf.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

18

Dabdoub, Sebastien Alberto. "Finding linearization violations in lock-free concurrent data structures." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/85413.

Der volle Inhalt der Quelle

Annotation:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (page 31).<br>Finding bugs in lock-free concurrent programs is hard. This is due in part to the difficulty of reasoning about the correctness of concurrent algorithms and the timing-sensitive nature of concurrent programs. One of the most widely used tools for reasoning about the correctness of concurrent algorithms is the linearization property. This thesis presents a tool for automatic dynamic

APA, Harvard, Vancouver, ISO und andere Zitierweisen

19

Lodolini, Lucia. "The representation of symmetric patterns using the Quadtree data structure /." Online version of thesis, 1988. http://hdl.handle.net/1850/8402.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

20

Mullins, Robert W. "Separating representation for translation of shared data in a heterogeneous computing environment /." This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-04272010-020125/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

21

Lee, Ka-hing, and 李家興. "The dictionary problem: theory andpractice." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31234963.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

22

Niemi, Timo. "Conversion of flat files and hierarchical data bases." Tampere, Finland : University of Tampere, 1985. http://catalog.hathitrust.org/api/volumes/oclc/15674199.html.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

23

Zee, Karen K. "Verification of full functional correctness for imperative linked data structures." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/58078.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 207-222).<br>We present the verification of full functional correctness for a collection of imperative linked data structures implemented in Java. A key technique that makes this verification possible is a novel, integrated proof language that we have developed within the context of the Jahob program verification system. Our proof language allows us to embed proof commands directly within the prog

APA, Harvard, Vancouver, ISO und andere Zitierweisen

24

McCallen, Scott J. "Mining Dynamic Structures in Complex Networks." Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1204154279.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

25

Zhang, Xin Iris, and 張欣. "Fast mining of spatial co-location patterns." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B30462708.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

26

Yang, Lei. "Querying Graph Structured Data." Case Western Reserve University School of Graduate Studies / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=case1410434109.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

27

Daoud, Amjad M. "Efficient data structures for information retrieval." Diss., Virginia Tech, 1993. http://hdl.handle.net/10919/40031.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

28

Brown, Patrick R. "A paging scheme for pointer-based quadtrees." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-10062009-020024/.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

29

宋永健 and Wing-kin Sung. "Fast labeled tree comparison via better matching algorithms." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31239316.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

30

黎少斌 and Shiao-bun Lai. "Trading off time for space for the string matching problem." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1996. http://hub.hku.hk/bib/B31214216.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

31

Sung, Wing-kin. "Fast labeled tree comparison via better matching algorithms /." Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20229999.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

32

Lai, Shiao-bun. "Trading off time for space for the string matching problem /." Hong Kong : University of Hong Kong, 1996. http://sunzi.lib.hku.hk/hkuto/record.jsp?B18061795.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

33

Van, den Hooff Jelle (Jelle August). "Fast bug finding in lock-free data structures with CB-DPOR." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/92058.

Der volle Inhalt der Quelle

Annotation:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 39-40).<br>This thesis describes CB-DPOR, an algorithm for quickly finding bugs in lock-free data structures. CB-DPOR is a combination of the CHESS and DPOR model checking algorithms. CB-DPOR performs similar to the concurre

APA, Harvard, Vancouver, ISO und andere Zitierweisen

34

Demurjian, Steven Arthur. "The multi-lingual database system : a paradigm and test-bed for the investigation of data-model transformations and data-model semantics /." The Ohio State University, 1987. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487324944214237.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

35

John, Ajita. "Linearly Ordered Concurrent Data Structures on Hypercubes." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc501197/.

Der volle Inhalt der Quelle

Annotation:

This thesis presents a simple method for the concurrent manipulation of linearly ordered data structures on hypercubes. The method is based on the existence of a pruned binomial search tree rooted at any arbitrary node of the binary hypercube. The tree spans any arbitrary sequence of n consecutive nodes containing the root, using a fan-out of at most [log₂ 𝑛] and a depth of [log₂ 𝑛] +1. Search trees spanning non-overlapping processor lists are formed using only local information, and can be used concurrently without contention problems. Thus, they can be used for performing broadcast and merge

APA, Harvard, Vancouver, ISO und andere Zitierweisen

36

Sheng, James Min. "Efficient geographic information systems : data structures, Boolean operations and concurrency control /." Online version of thesis, 1990. http://hdl.handle.net/1850/10594.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

37

Sundaravadivelu, Rathinasabapathy. "Interoperability between heterogeneous and distributed biodiversity data sources in structured data networks." Thesis, Cardiff University, 2010. http://orca.cf.ac.uk/18086/.

Der volle Inhalt der Quelle

Annotation:

The extensive capturing of biodiversity data and storing them in heterogeneous information systems that are accessible on the internet across the globe has created many interoperability problems. One is that the data providers are independent of others and they can run systems which were developed on different platforms at different times using different software products to respond to different needs of information. A second arises from the data modelling used to convert the real world data into a computerised data structure which is not conditioned by a universal standard. Most importantly t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

38

Brisson, Erik. "Representation of d-dimensional geometric objects /." Thesis, Connect to this title online; UW restricted, 1990. http://hdl.handle.net/1773/6903.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

39

Mak, Vivian. "Algorithms for proximity problems in the presence of obstacles /." Hong Kong : University of Hong Kong, 1999. http://sunzi.lib.hku.hk/hkuto/record.jsp?B21414944.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

40

Kim, Deokhwan. "Verification of semantic commutativity conditions and inverse operations on linked data structures." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/68502.

Der volle Inhalt der Quelle

Annotation:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 57-61).<br>We present a new technique for verifying commutativity conditions, which are logical formulas that characterize when operations commute. Because our technique reasons with the abstract state of verified linked data structure implementations, it can verify commuting operations that produce semantically equivalent (but not necessarily identical) data structure states in different execution

APA, Harvard, Vancouver, ISO und andere Zitierweisen

41

Mak, Vivian, and 麥慧芸. "Algorithms for proximity problems in the presence of obstacles." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B29822749.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

42

Rao, Ananth K. "The DFS distributed file system : design and implementation." Online version of thesis, 1989. http://hdl.handle.net/1850/10500.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

43

Robson, R. "Data views for a programming environment." Thesis, McGill University, 1988. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=75754.

Der volle Inhalt der Quelle

Annotation:

A data structure editor is presented for use in an integrated, fragment-based programming environment. This editor employs high resolution computer graphics to present the user with an iconic representation of the internal storage of a running program.<br>The editor allows the creation, modification, and deletion of data structures. These abilities allow the user to quickly sketch data structures with which to test incomplete program fragments, alleviating the need for driver routines.<br>To keep the user cognizant of events inside his program, a technique for automated display management is p

APA, Harvard, Vancouver, ISO und andere Zitierweisen

44

Mehdawi, Nader. "Monitoring for Underdetermined Underground Structures during Excavation Using Limited Sensor Data." Master's thesis, University of Central Florida, 2013. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5670.

Der volle Inhalt der Quelle

Annotation:

A realistic field monitoring application to evaluate close proximity tunneling effects of a new tunnel on an existing tunnel is presented. A blind source separation (BSS)-based monitoring framework was developed using sensor data collected from the existing tunnel while the new tunnel was excavated. The developed monitoring framework is particularly useful to analyze underdetermined systems due to insufficient sensor data for explicit input force-output deformation relations. The analysis results show that the eigen-parameters obtained from the correlation matrix of raw sensor data can be u

APA, Harvard, Vancouver, ISO und andere Zitierweisen

45

Wong, Ka Chun. "Optimal expected-case planar point location /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?COMP%202005%20WONG.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

46

Malamatos, Theocharis. "Expected-case planar point location /." View Abstract or Full-Text, 2002. http://library.ust.hk/cgi/db/thesis.pl?COMP%202002%20MALAMA.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

47

Lai, Ka-ying. "Solving multiparty private matching problems using Bloom-filters." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B37854847.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

48

Lai, Ka-ying, and 黎家盈. "Solving multiparty private matching problems using Bloom-filters." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B37854847.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

49

Lau, Ching Hin. "An I/O-efficient data structure for querying XML with inherited attributes /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CSED%202009%20LAU.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

50

Su, Wei. "Motif Mining On Structured And Semi-structured Biological Data." Case Western Reserve University School of Graduate Studies / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=case1365089538.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!