Thematische Bibliographien / Data structures

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Data structures“

Autor: Grafiati
Veröffentlicht am 4. Juni 2021
Zuletzt aktualisiert am 1. August 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 den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Data structures" 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.

Zeitschriftenartikel zum Thema "Data structures"

1

Tamassia, Roberto. „Data structures“. ACM Computing Surveys 28, Nr. 1 (März 1996): 23–26. http://dx.doi.org/10.1145/234313.234323.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Jarc, Duane J. „Data structures“. ACM SIGCSE Bulletin 26, Nr. 2 (Juni 1994): 2–4. http://dx.doi.org/10.1145/181648.181651.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Biswas, Ranjit. „Data structures for big data“. International Journal of Computing and Optimization 1 (2014): 73–93. http://dx.doi.org/10.12988/ijco.2014.4813.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Basch, Julien, Leonidas J. Guibas und John Hershberger. „Data Structures for Mobile Data“. Journal of Algorithms 31, Nr. 1 (April 1999): 1–28. http://dx.doi.org/10.1006/jagm.1998.0988.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Yarosh, Svetlana, und Mark Guzdial. „Narrating data structures“. Journal on Educational Resources in Computing 7, Nr. 4 (Januar 2008): 1–20. http://dx.doi.org/10.1145/1316450.1316456.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

RUUS, H. „Lexical Data Structures“. Literary and Linguistic Computing 3, Nr. 3 (01.07.1988): 169–76. http://dx.doi.org/10.1093/llc/3.3.169.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Giles, D. „Editorial - Data Structures“. Computer Journal 34, Nr. 5 (01.05.1991): 385. http://dx.doi.org/10.1093/comjnl/34.5.385.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Demaine, Erik D., John Iacono und Stefan Langerman. „Retroactive data structures“. ACM Transactions on Algorithms 3, Nr. 2 (Mai 2007): 13. http://dx.doi.org/10.1145/1240233.1240236.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Louchard, G., Claire Kenyon und R. Schott. „Data Structures' Maxima“. SIAM Journal on Computing 26, Nr. 4 (August 1997): 1006–42. http://dx.doi.org/10.1137/s0097539791196603.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Nair, Achuth Sankar S., und T. Mahalakshmi. „Conceptualizing data structures“. ACM SIGCSE Bulletin 36, Nr. 4 (Dezember 2004): 97–100. http://dx.doi.org/10.1145/1041624.1041668.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "Data structures"

1

Jarvis, Kimberley James. „Transactional data structures“. Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/transactional-data-structures(7060eaec-7dbd-4d5a-be1a-a753d9aa32d5).html.

Der volle Inhalt der Quelle
Annotation:
Concurrent programming is difficult and the effort is rarely rewarded by faster execution. The concurrency problem arises because information cannot pass instantly between processors resulting in temporal uncertainty. This thesis explores the idea that immutable data and distributed concurrency control can be combined to allow scalable concurrent execution and make concurrent programming easier. A concurrent system that does not impose a global ordering on events lends itself to a scalable distributed implementation. A concurrent programming environment in which the ordering of events affecting an object is enforced locally has intuitive concurrent semantics. This thesis introduces Transactional Data Structures which are data structures that permit access to past versions, although not all accesses succeed. These data structures form the basis of a concurrent programming solution that supports database type transactions in memory. Transactional Data Structures permit non-blocking concurrent access to familiar abstract data types such as deques, maps, vectors and priority queues. Using these data structures a programmer can write a concurrent program in C without having to reason about locks. The solution is evaluated by comparing the performance of a concurrent algorithm to calculate the minimum spanning tree of a graph with that of a similar algorithm which uses Transactional Memory and by comparing a non-blocking Producer Consumer Queue with its blocking counterpart.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

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.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 175-180).
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-tuning data structure algorithms to get good performance across a variety of machines and inputs is a herculean task to add to the fundamental difficulty of getting a parallel program correct. To help mitigate these complexities, this work develops a new class of parallel data structures called Smart Data Structures that leverage online machine learning to adapt themselves automatically. We prototype and evaluate an open source library of Smart Data Structures for common parallel programming needs and demonstrate signicant improvements over the best existing algorithms under a variety of conditions. Our results indicate that learning is a promising technique for balancing and adapting to complex, time-varying tradeoffs and achieving the best performance available.
by Jonathan M. Eastep.
Ph.D.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

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 thesis are space efficient, requiring little additional storage. We begin the discussion with a layout for a search tree within an array. This layout allows Searches to be performed in O(log n) time and in O(log n/log L) (the optimal number) cache misses. An algorithm for building this layout from a sorted array in linear time is given. One use for this layout is a heap-like implementation of the priority queue. This structure allows Inserts, Heapifies and ExtractMaxes in O(log n) time and O(log nlog L) cache misses. A priority queue using this layout can be builtfrom an unsorted array in linear time. Besides the n spaces required to hold the data, this structure uses a constant amount of additional storage. The cache oblivious linear list allows scans of the list taking Theta(n) time and incurring Theta(n/L) (the optimal number) cache misses. The running time of insertions and deletions is not constant, however it is sub-polynomial. This structure requires e*n additional storage, where e is any constant greater than zero.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Chaudhary, Amitabh. „Applied spatial data structures for large data sets“. Available to US Hopkins community, 2002. http://wwwlib.umi.com/dissertations/dlnow/3068131.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

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-level model is "small". In this thesis, we develop data structures and techniques that can tolerate these large numbers of states.;First, we present a multi-level data structure for storing the set of reachable states of a model. We then introduce the concept of event "locality", which considers the components of the model that an event may affect. We show how a state generation algorithm using our multi-level structure can exploit event locality to reduce CPU requirements.;Then, we present a symbolic generation technique based on our multi-level structure and our concept of event locality, in which operations are applied to sets of states. The extremely compact data structure and efficient manipulation routines we present allow for the examination of much larger systems than was previously possible.;The transition rate matrix of the underlying CTMC can be represented with Kronecker algebra under certain conditions. However, the use of Kronecker algebra introduces several sources of CPU overhead during numerical solution. We present data structures, including our new data structure called matrix diagrams, that can reduce this CPU overhead. Using our techniques, we can compute measures for large systems in a fraction of the time required by current state-of-the-art techniques.;Finally, we present a technique for approximating stationary measures using aggregations of the underlying CTMC. Our technique utilizes exact knowledge of the underlying CTMC using our compact data structure for the reachable states and a Kronecker representation for the transition rates. We prove that the approximation is exact for models possessing a product-form solution.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Jürgens, Marcus. „Index structures for data warehouses“. [S.l. : s.n.], 1999. http://www.diss.fu-berlin.de/2000/93/index.html.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Jürgens, Marcus. „Index structures for data warehouses“. Berlin ; Heidelberg : Springer, 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=96554155X.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Colbrook, Adrian. „The engineering of data structures“. Thesis, University of Surrey, 1990. http://epubs.surrey.ac.uk/843605/.

Der volle Inhalt der Quelle
Annotation:
Abstraction in computer programming provides a means of reducing complexity by emphasising the significant information (program behaviour) whilst suppressing the immaterial (program implementation). This aids program construction, improves reliability and maintainability, and eases the application of formal correctness proofs. The importance of data abstraction in the specification, design and implementation of large systems raises the question as to whether such methods may be applied in the context of programming languages designed before the widespread use of abstraction techniques. The program structuring facilities available in FORTRAN 77 support a form of encapsulation for simple data structures. In light of this mechanism provided by the language, state-based specification was found to be most appropriate. A specification technique incorporating object-oriented techniques is particularly suitable and allows a library of object classes to be specified and then implemented in sequential FORTRAN 77. Refinement extends the object classes so as to provide the commonly occurring generators for use in iterative constructs. Therefore, the advantages of data abstraction methods may be obtained in an early procedural language such as FORTRAN 77. Data abstraction provides data independence : a change in the representation for a particular class of objects affects only the code that implements the associated operations. This allows parallel implementations to be considered, without changes to the original specification or to any user-code. The provision of such parallel data structures is required for the migration of sequential systems onto parallel distributed memory architectures. As an illustration of this approach a general 2P2-2P (for integer P≥3) search tree utilising a pipeline of processors in a distributed memory architecture is shown to provide a means of implementing the object classes. Variations in both the number of processors allocated to the pipeline and the value of P allows the optimal search structure for a given architecture to be determined. These structures are highly efficient leading to improvements in both throughput and response time as processors are added to the array. An efficient parallel implementation of object classes is therefore achieved within the tight interface provided by abstraction.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Jürgens, Marcus. „Index structures for data warehouses /“. Berlin [u.a.] : Springer, 2002. http://www.loc.gov/catdir/enhancements/fy0817/2002021075-d.html.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Goulet, Jean 1939. „Data structures for chess programs“. Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=65427.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "Data structures"

1

David, Giles, Hrsg. Data structures. Cambridge: Cambridge University Press, for the British Computer Society., 1991.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Keogh, James Edward. Data structures demystified. New York: McGraw-Hill/Osborne, 2004.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Yedidyah, Langsam, und Augenstein Moshe J, Hrsg. Data structures usingC. Englewood Cliffs, N.J: Prentice Hall, 1990.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Lubiw, Anna, und Mohammad Salavatipour, Hrsg. Algorithms and Data Structures. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83508-8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Friggstad, Zachary, Jörg-Rüdiger Sack und Mohammad R. Salavatipour, Hrsg. Algorithms and Data Structures. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-24766-9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Akl, Selim G., Frank Dehne, Jörg-Rüdiger Sack und Nicola Santoro, Hrsg. Algorithms and Data Structures. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-60220-8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Dehne, Frank, Roberto Solis-Oba und Jörg-Rüdiger Sack, Hrsg. Algorithms and Data Structures. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40104-6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Dehne, Frank, Marina Gavrilova, Jörg-Rüdiger Sack und Csaba D. Tóth, Hrsg. Algorithms and Data Structures. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03367-4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Dehne, Frank, Jörg-Rüdiger Sack und Roberto Tamassia, Hrsg. Algorithms and Data Structures. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44634-6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Dehne, Frank, Alejandro López-Ortiz und Jörg-Rüdiger Sack, Hrsg. Algorithms and Data Structures. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11534273.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "Data structures"

1

Jay, Barry. „Data Structures“. In Pattern Calculus, 23–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-89185-7_3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Angell, Ian O., und Dimitrios Tsoubelis. „Data structures“. In Advanced Graphics on VGA and XGA Cards Using Borland C++, 47–70. London: Macmillan Education UK, 1992. http://dx.doi.org/10.1007/978-1-349-22336-7_3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

King, M. J., und J. P. Pardoe. „Data Structures“. In Program Design Using JSP, 4–15. London: Macmillan Education UK, 1992. http://dx.doi.org/10.1007/978-1-349-22081-6_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Dudman, Kay. „Data structures“. In JSP for Practical Program Design, 7–28. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4757-2537-7_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Hunt, John. „Data Structures“. In Java for Practitioners, 131–46. London: Springer London, 1999. http://dx.doi.org/10.1007/978-1-4471-0843-6_14.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Taylor, Graham. „Data Structures“. In Making Sense of Information Technology, 151–77. London: Macmillan Education UK, 1988. http://dx.doi.org/10.1007/978-1-349-10649-3_9.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Hodges, Jason Lee. „Data Structures“. In Software Engineering from Scratch, 231–56. Berkeley, CA: Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-5206-2_12.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Manelli, Luciano. „Data Structures“. In Introducing Algorithms in C, 1–12. Berkeley, CA: Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5623-7_1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Betounes, David, und Mylan Redfern. „Data Structures“. In Mathematical Computing, 149–201. New York, NY: Springer New York, 2002. http://dx.doi.org/10.1007/978-1-4613-0067-0_6.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Johansson, Anna-Lena, Agneta Eriksson-Granskog und Anneli Edman. „Data Structures“. In Prolog Versus You, 55–75. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-71922-6_3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Data structures"

1

Pinto, Domenick J. „Data structures“. In the 1988 ACM sixteenth annual conference. New York, New York, USA: ACM Press, 1988. http://dx.doi.org/10.1145/322609.323146.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Patrascu, Mihai. „(Data) STRUCTURES“. In 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, 2008. http://dx.doi.org/10.1109/focs.2008.69.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Rogowitz, Bernice E., und Lloyd A. Treinish. „Data structures and perceptual structures“. In IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, herausgegeben von Jan P. Allebach und Bernice E. Rogowitz. SPIE, 1993. http://dx.doi.org/10.1117/12.152734.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

RUSH, T., P. SCHRANTZ und B. AGRAWAL. „Analysis of Intelsat V flight data“. In 28th Structures, Structural Dynamics and Materials Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1987. http://dx.doi.org/10.2514/6.1987-784.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Campbell, Mark, und Mark Campbell. „Uncertainty effects in model-data correlation“. In 38th Structures, Structural Dynamics, and Materials Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1997. http://dx.doi.org/10.2514/6.1997-1030.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

SMITH, SUZANNE, und CHRISTOPHER BEATTIE. „Optimal identification using inconsistent modal data“. In 32nd Structures, Structural Dynamics, and Materials Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1991. http://dx.doi.org/10.2514/6.1991-948.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

KUNZ, D., und A. HOPKINS. „Structured data in structural analysis software“. In 26th Structures, Structural Dynamics, and Materials Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1985. http://dx.doi.org/10.2514/6.1985-742.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Micciancio, Daniele. „Oblivious data structures“. In the twenty-ninth annual ACM symposium. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/258533.258638.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Balakrishnan, Darshana, Lukasz Ziarek und Oliver Kennedy. „Fluid data structures“. In the 17th ACM SIGPLAN International Symposium. New York, New York, USA: ACM Press, 2019. http://dx.doi.org/10.1145/3315507.3330197.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Goodrich, Michael T., Evgenios M. Kornaropoulos, Michael Mitzenmacher und Roberto Tamassia. „Auditable Data Structures“. In 2017 IEEE European Symposium on Security and Privacy (EuroS&P). IEEE, 2017. http://dx.doi.org/10.1109/eurosp.2017.46.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Data structures"

1

Mix, Scott, Mark Rice, Siddharth Sridhar, Charles Schmidt, Srini Raju, Carlos Gonzales-Perez und Debraj Bharadwaj. Universal Utility Data Exchange (UUDEV) - Data Structures. Office of Scientific and Technical Information (OSTI), September 2020. http://dx.doi.org/10.2172/1778856.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Kahan, Simon. Data Structures for Extreme Scale Computing. Office of Scientific and Technical Information (OSTI), August 2017. http://dx.doi.org/10.2172/1395134.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Liblit, Ben, und Alexander Aiken. Type Systems for Distributed Data Structures. Fort Belvoir, VA: Defense Technical Information Center, November 1999. http://dx.doi.org/10.21236/ada603881.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Bowman, Keith, und Xiaoping Qian. Uncovering Topological Structures in Unstructured Data. Fort Belvoir, VA: Defense Technical Information Center, April 2015. http://dx.doi.org/10.21236/ada619112.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Currie, A., und B. Ady. GEOSIS project: knowledge representation and data structures for geoscience data. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 1990. http://dx.doi.org/10.4095/128053.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Portier, Rebecca W., Richard D. Peacock und Paule A. Reneke. Data structures for the fire data management system, FDMS 2.0. Gaithersburg, MD: National Institute of Standards and Technology, 1997. http://dx.doi.org/10.6028/nist.ir.6088.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Tamassia, Roberto. Dynamic Data Structures for Two-Dimensional Searching. Fort Belvoir, VA: Defense Technical Information Center, August 1988. http://dx.doi.org/10.21236/ada201173.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Lofstead II, Gerald F. Integrated IO Services for Trilinos Data Structures. Office of Scientific and Technical Information (OSTI), Januar 2015. http://dx.doi.org/10.2172/1504109.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Ravichandran, A., und K. Kant. Analysis and Synthesis of Robust Data Structures. Fort Belvoir, VA: Defense Technical Information Center, August 1990. http://dx.doi.org/10.21236/ada224568.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Giglio, Stefano, Bryan Kelly und Serhiy Kozak. Equity Term Structures without Dividend Strips Data. Cambridge, MA: National Bureau of Economic Research, April 2023. http://dx.doi.org/10.3386/w31119.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Data structures" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher
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!

Zur Bibliographie