Vita

Topic: Data structures

291
291

Mar 25, 2019
03/19

by
Goyal Lalit

texts

######
eye 291

######
favorite 0

######
comment 0

Goyal Lalit, A Simplified Approach To Data Structures, Data Structures

Topics: Goyal Lalit, A Simplified Approach To Data Structures, Data Structures

15
15

texts

######
eye 15

######
favorite 0

######
comment 0

library help

Topics: weapons, c#, data structures

Data Structures

Topics: Data Structures, هياكل البيانات

48
48

Dec 9, 2011
12/11

by
Pfaltz, John L

texts

######
eye 48

######
favorite 1

######
comment 1

Bibliography: p. 434-436

( 1 reviews )

Topic: Data structures (Computer science)

59
59

Nov 29, 2010
11/10

by
Keogh, James Edward, 1948-; Davidson, Ken

texts

######
eye 59

######
favorite 2

######
comment 0

Includes quizzes and answers

Topic: Data structures (Computer science)

100
100

Mar 3, 2010
03/10

by
Dale L. Peterson, Sean Davis

movies

######
eye 100

######
favorite 0

######
comment 0

UC Davis ECS 60, taught by Sean Davis, Winter 2010 Disjoint Sets

Topics: Data structures, algorithms

77
77

texts

######
eye 77

######
favorite 1

######
comment 0

Who ever learn data structure and algorithms can ready this book. and its very nice book written by Michael T. Goodrich, Roberto Tamassia and Michael H. Goldwasser.

Topic: python data structures algorithms

131
131

Jun 29, 2012
06/12

by
Korsh, James F., 1938-

texts

######
eye 131

######
favorite 4

######
comment 0

Bibliography: p. 489-493

Topic: Data structures (Computer science)

97
97

Jan 22, 2020
01/20

by
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

texts

######
eye 97

######
favorite 4

######
comment 0

One of the best known books for learning DataStructures and Algorithms

Topics: Data Structures, Algorithms

105
105

Mar 4, 2010
03/10

by
Dale L. Peterson, Sean Davis

movies

######
eye 105

######
favorite 0

######
comment 0

UC Davis ECS 60, taught by Sean Davis, Winter 2010 Topological Sort

Topics: Data structures, algorithms

401
401

Mar 3, 2010
03/10

by
Dale L. Peterson, Sean Davis

movies

######
eye 401

######
favorite 0

######
comment 0

UC Davis ECS 60, taught by Sean Davis, Winter 2010 Splay trees, tree traversals

Topics: Data structures, algorithms

678
678

Sep 10, 2008
09/08

by
Folinus, Jeffrey J. (Jeffrey Joseph); Madnick, Stuart E; Schutzman, Howard B. (Howard Bruce)

texts

######
eye 678

######
favorite 0

######
comment 0

Bibliography: leaves 21-23

Topic: Data structures (Computer science)

107
107

Mar 3, 2010
03/10

by
Dale L. Peterson, Sean Davis

movies

######
eye 107

######
favorite 0

######
comment 0

UC Davis ECS 40, taught by Sean Davis, Winter 2010 Amortized cost

Topics: Data structures, algorithms

8
8.0

texts

######
eye 8

######
favorite 0

######
comment 0

Inroduction to Data structures and Algorithms || Deepali Srivastava

Topic: Data structures algorithm

79
79

Sep 15, 2010
09/10

by
Tilford, John S; Reingold, Edward M., 1945- Data structures

texts

######
eye 79

######
favorite 0

######
comment 0

Topic: Data structures (Computer science)

3
3.0

Nov 5, 2019
11/19

by
Deepali Srivastava

texts

######
eye 3

######
favorite 0

######
comment 0

3. Linked List By Deepali Srivastava

Topic: Data structures and algorithm

58
58

Jun 21, 2019
06/19

by
Standish, Thomas A., 1941-

texts

######
eye 58

######
favorite 2

######
comment 0

xvi, 447 p. : 24 cm. --

Topic: Data structures (Computer science)

10
10.0

Nov 5, 2019
11/19

by
Deepali Srivastava

texts

######
eye 10

######
favorite 0

######
comment 0

4. Stack and Queue data structures and algorithms Deepali Srivastava

Topic: data structures and algorithms

252
252

texts

######
eye 252

######
favorite 0

######
comment 0

Algorithms & Data Structures Lec

Topic: Algorithms & Data Structures Lec

Topics: computer science, data structures

64,329
64K

Oct 31, 2013
10/13

by
MIT OpenCourseWare

movies

######
eye 64,329

######
favorite 1

######
comment 0

View the complete course: http://ocw.mit.edu/6-851S12 Instructor: Erik Demaine Videos of 6.851 Lectures Spring 2012 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Topic: advanced data structures

4,584
4.6K

texts

######
eye 4,584

######
favorite 1

######
comment 2

Data structures a pseudocode approach with C++

( 2 reviews )

Topics: data structures, C++

483
483

Sep 30, 2016
09/16

by
bryon gottfried

texts

######
eye 483

######
favorite 0

######
comment 0

c and data structure

Topics: c, data structures

26
26

Jul 11, 2018
07/18

by
Simsion, Graeme C

texts

######
eye 26

######
favorite 0

######
comment 0

xx, 310 pages : 24 cm

Topics: Database design, Data structures (Computer science), Data structures (Computer science), Database...

15
15

Dec 5, 2017
12/17

by
Thomas Wies, Viktor Kuncak, Patrick Lam, Andreas Podelski, and Martin Rinard

texts

######
eye 15

######
favorite 0

######
comment 0

Weintroduce fieldconstraintanalysis ,anewtechniqueforverifyingdatastruc- ture invariants. A field constraint for a field is a formula specifying a set of objects to which the field can point. Field constraints enable the application of decidable logics to data struc- tures which were originally beyond the scope of these logics, by verifying the backbone of the data structure and then verifying constraints on fields that cross-cut the backbone in arbitrary ways. Previously, such cross-cutting...

Topics: data structures, field constraint analysis

82
82

Mar 3, 2010
03/10

by
Dale L. Peterson, Sean Davis

movies

######
eye 82

######
favorite 0

######
comment 0

UC Davis ECS 60, taught by Sean DAvis, Winter 2010 Binary heaps

Topics: Data structures, algorithms, binary heaps

35
35

Dec 21, 2019
12/19

by
Lewis, T. G. (Theodore Gyle), 1941-

texts

######
eye 35

######
favorite 0

######
comment 0

xii, 290 pages : 25 cm

Topics: Data structures (Computer science), Datenstruktur

111
111

Mar 3, 2010
03/10

by
Dale L. Peterson, Sean Davis

movies

######
eye 111

######
favorite 0

######
comment 0

UC Davis ECS 60, taught by Sean Davis, Winter 2010 Hash tables.

Topics: Data structures, algorithms, hash tables

59
59

movies

######
eye 59

######
favorite 0

######
comment 0

Sophia Davis - Peeking into Python’s C API [EuroPython 2016] [22 July 2016 / 2016-07-22] [Bilbao, Euskadi, Spain] (https://ep2016.europython.eu//conference/talks/peeking-into-pythons-c-api) Ever wondered how Python works under the hood? One way to learn about Python-the-C-program is by exploring the C API for writing Python bindings to native C libraries. In this talk, we will walk through a simple example of making a C library callable from Python code and vice versa. Along the way, we will...

Topics: Data Structures, CPython, EuroPython2016, Python

17
17

Jan 21, 2020
01/20

by
Barnett, Michael P

texts

######
eye 17

######
favorite 1

######
comment 0

x, 279, [15] p. : 24 cm

Topics: Data structures (Computer science), Algorithms

59
59

texts

######
eye 59

######
favorite 0

######
comment 0

Topics: Computer Science, Data Structures, Python

47
47

Mar 23, 2019
03/19

by
Mehlhorn, Kurt, 1949-

texts

######
eye 47

######
favorite 1

######
comment 0

3 v. : 25 cm. --

Topics: Algorithms, Data structures (Computer science)

26
26

Nov 8, 2019
11/19

by
Naps, Thomas L

texts

######
eye 26

######
favorite 0

######
comment 0

xix, 464, 6 pages : 26 cm

Topics: Data structures (Computer science), Pascal (Computer program language), adatszerkezetek...

xv, 235 pages : 24 cm

Topics: File organization (Computer science), Data structures (Computer science), Data structures (Computer...

"In this Data Set Standardization Handbook, the Bureau of Land Management presents its procedures for developing, approving, implementing, and revising (1) the data elements it plans to use in automated systems bureauwide to help it more successfully carry out its mission and (2) the standards for the data; the rules by which data will be described and recorded"--Page 1

Topics: United States. Bureau of Land Management, Data structures (Computer science), Data structures...

0
0.0

Jun 29, 2018
06/18

by
Alexander A. Loboda; Maxim N. Artyomov; Alexey A. Sergushichev

texts

######
eye 0

######
favorite 0

######
comment 0

Network enrichment analysis methods allow to identify active modules without being biased towards a priori defined pathways. One of mathematical formulations of such analysis is a reduction to a maximum-weight connected subgraph problem. In particular, in analysis of metabolic networks a generalized maximum-weight connected subgraph (GMWCS) problem, where both nodes and edges are scored, naturally arises. Here we present the first to our knowledge practical exact GMWCS solver. We have tested it...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1605.02168

0
0.0

Jun 29, 2018
06/18

by
Chidambaram Annamalai

texts

######
eye 0

######
favorite 0

######
comment 0

We study the restricted case of Scheduling on Unrelated Parallel Machines. In this problem, we are given a set of jobs $J$ with processing times $p_j$ and each job may be scheduled only on some subset of machines $S_j \subseteq M$. The goal is to find an assignment of jobs to machines to minimize the time by which all jobs can be processed. In a seminal paper, Lenstra, Shmoys, and Tardos designed an elegant $2$-approximation for the problem in 1987. The question of whether approximation...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1611.07371

1
1.0

Jun 29, 2018
06/18

by
Sofia Kleisarchaki; Sihem Amer-Yahia; Ahlame Douzal-Chouakria; Vassilis Christophides

texts

######
eye 1

######
favorite 0

######
comment 0

There exists a large body of work on online drift detection with the goal of dynamically finding and maintaining changes in data streams. In this paper, we adopt a query-based approach to drift detection. Our approach relies on {\em a drift index}, a structure that captures drift at different time granularities and enables flexible {\em drift queries}. We formalize different drift queries that represent real-world scenarios and develop query evaluation algorithms that use different...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1605.02772

0
0.0

Jun 29, 2018
06/18

by
Julia Chuzhoy; David H. K. Kim; Shi Li

texts

######
eye 0

######
favorite 0

######
comment 0

We study the classical Node-Disjoint Paths (NDP) problem: given an $n$-vertex graph $G$ and a collection $M=\{(s_1,t_1),\ldots,(s_k,t_k)\}$ of pairs of vertices of $G$ called demand pairs, find a maximum-cardinality set of node-disjoint paths connecting the demand pairs. NDP is one of the most basic routing problems, that has been studied extensively. Despite this, there are still wide gaps in our understanding of its approximability: the best currently known upper bound of $O(\sqrt n)$ on its...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1603.05520

1
1.0

Jun 29, 2018
06/18

by
Marc Bury; Chris Schwiegelshohn

texts

######
eye 1

######
favorite 0

######
comment 0

The Jaccard index is an important similarity measure for item sets and Boolean data. On large datasets, an exact similarity computation is often infeasible for all item pairs both due to time and space constraints, giving rise to faster approximate methods. The algorithm of choice used to quickly compute the Jaccard index $\frac{\vert A \cap B \vert}{\vert A\cup B\vert}$ of two item sets $A$ and $B$ is usually a form of min-hashing. Most min-hashing schemes are maintainable in data streams...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1605.03949

1
1.0

Jun 27, 2018
06/18

by
Kyle Fox; Philip N. Klein; Shay Mozes

texts

######
eye 1

######
favorite 0

######
comment 0

Given an undirected graph with edge costs and node weights, the minimum bisection problem asks for a partition of the nodes into two parts of equal weight such that the sum of edge costs between the parts is minimized. We give a polynomial time bicriteria approximation scheme for bisection on planar graphs. Specifically, let $W$ be the total weight of all nodes in a planar graph $G$. For any constant $\varepsilon > 0$, our algorithm outputs a bipartition of the nodes such that each part...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1504.08008

0
0.0

Jun 30, 2018
06/18

by
Marek Chrobak; Christoph Durr; Aleksander Fabijan; Bengt Nilsson

texts

######
eye 0

######
favorite 0

######
comment 0

Clique clustering is the problem of partitioning the vertices of a graph into disjoint clusters, where each cluster forms a clique in the graph, while optimizing some objective function. In online clustering, the input graph is given one vertex at a time, and any vertices that have previously been clustered together are not allowed to be separated. The goal is to maintain a clustering with an objective value close to the optimal solution. For the variant where we want to maximize the number of...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1411.4274

1
1.0

Jun 30, 2018
06/18

by
Qin Huang; Xingwu Liu; Xiaoming Sun; Jialin Zhang

texts

######
eye 1

######
favorite 0

######
comment 0

In this paper we investigate the top-$k$-selection problem, i.e. determine the largest, second largest, ..., and the $k$-th largest elements, in the dynamic data model. In this model the order of elements evolves dynamically over time. In each time step the algorithm can only probe the changes of data by comparing a pair of elements. Previously only two special cases were studied[2]: finding the largest element and the median; and sorting all elements. This paper systematically deals with $k\in...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1412.8164

0
0.0

Jun 29, 2018
06/18

by
Klaus Jansen; Malin Rau

texts

######
eye 0

######
favorite 0

######
comment 0

We study the well-known two-dimensional strip packing problem. Given is a set of rectangular axis-parallel items and a strip of width $W$ with infinite height. The objective is to find a packing of these items into the strip, which minimizes the packing height. Lately, it has been shown that the lower bound of $3/2$ of the absolute approximation ratio can be beaten when we allow a pseudo-polynomial running-time of type $(n W)^{f(1/\varepsilon)}$. If $W$ is polynomially bounded by the number of...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1610.04430

1
1.0

Jun 30, 2018
06/18

by
Flávio K. Miyazawa; Lehilton L. C. Pedrosa; Rafael C. S. Schouery; Maxim Sviridenko; Yoshiko Wakabayashi

texts

######
eye 1

######
favorite 0

######
comment 0

We give an asymptotic approximation scheme (APTAS) for the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augmented bins of height $1+\gamma$, for some arbitrarily small number $\gamma > 0$. Our algorithm is polynomial on $\log 1/\gamma$, and thus $\gamma$ is part of the problem input. For the special case that $\gamma$ is constant, we give a (one dimensional) resource augmentation scheme, that is, we obtain a packing into...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1412.4709

6
6.0

Jun 27, 2018
06/18

by
Sebastian Maneth; Fabian Peternek

texts

######
eye 6

######
favorite 0

######
comment 0

We present an informal survey (meant to accompany another paper) on graph compression methods. We focus on lossless methods, briefly list available pproaches, and compare them where possible or give some indicators on their compression ratios. We also mention some relevant results from the field of lossy compression and algorithms specialized for the use on large graphs. --- Note: The comparison is by no means complete. This document is a first draft and will be updated and extended.

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1504.00616

4
4.0

Jun 29, 2018
06/18

by
Michael Elkin; Ofer Neiman

texts

######
eye 4

######
favorite 0

######
comment 0

Miller et al. \cite{MPVX15} devised a distributed\footnote{They actually showed a PRAM algorithm. The distributed algorithm with these properties is implicit in \cite{MPVX15}.} algorithm in the CONGEST model, that given a parameter $k = 1,2,\ldots$, constructs an $O(k)$-spanner of an input unweighted $n$-vertex graph with $O(n^{1+1/k})$ expected edges in $O(k)$ rounds of communication. In this paper we improve the result of \cite{MPVX15}, by showing a $k$-round distributed algorithm in the same...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1607.08337

0
0.0

Jun 30, 2018
06/18

by
Minming Li; Frances F. Yao; Hao Yuan

texts

######
eye 0

######
favorite 0

######
comment 0

Dynamic Voltage Scaling techniques allow the processor to set its speed dynamically in order to reduce energy consumption. In the continuous model, the processor can run at any speed, while in the discrete model, the processor can only run at finite number of speeds given as input. The current best algorithm for computing the optimal schedules for the continuous model runs at $O(n^2\log n)$ time for scheduling $n$ jobs. In this paper, we improve the running time to $O(n^2)$ by speeding up the...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1408.5995

0
0.0

Jun 28, 2018
06/18

by
Jie You; Jianxin Wang; Yixin Cao

texts

######
eye 0

######
favorite 0

######
comment 0

A vertex set $X$ of a graph $G$ is an association set if each component of $G - X$ is a clique, or a dissociation set if each component of $G - X$ is a single vertex or a single edge. Interestingly, $G - X$ is then precisely a graph containing no induced $P_3$'s or containing no $P_3$'s, respectively. We observe some special structures and show that if none of them exists, then the minimum association set problem can be reduced to the minimum (weighted) dissociation set problem. This yields the...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1510.08276