- Author:
- Mark Allen Weiss
No abstract available.
Cited By
- Rupprecht T, Chen X, White D, Boockmann J, Lüttgen G and Bos H DSIbin: identifying dynamic data structures in C/C++ binaries Proceedings of the 32nd IEEE/ACM International Conference on Automated Software Engineering, (331-341)
White D, Rupprecht T and Lüttgen G DSI: an evidence-based approach to identify dynamic data structures in C programs Proceedings of the 25th International Symposium on Software Testing and Analysis, (259-269)- White D and Lüttgen G Identifying dynamic data structures by learning evolving patterns in memory Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems, (354-369)
- Pal R (2007). RKPianGraphSort, Ubiquity, 2007:October, (1-16), Online publication date: 1-Oct-2007.
- Jiang S (2005). Granular differentiated queueing services for QoS, ACM SIGCOMM Computer Communication Review, 35:2, (13-22), Online publication date: 1-Apr-2005.
- Barrett J A framework for developing and managing objects in a complex simulation system Proceedings of the 29th conference on Winter simulation, (497-503)
- Gurwitz C (1995). Achieving a uniform interface for binary tree implementations, ACM SIGCSE Bulletin, 27:1, (66-70), Online publication date: 15-Mar-1995.
- Gurwitz C Achieving a uniform interface for binary tree implementations Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science education, (66-70)
Index Terms
- Data structures and algorithm analysis in C
Recommendations
Squeezing succinct data structures into entropy bounds
SODA '06: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithmConsider a sequence S of n symbols drawn from an alphabet A = {1, 2,. . .,σ}, stored as a binary string of nlog σ bits. A succinct data structure on S supports a given set of primitive operations on S using just f (n) = o(n log σ) extra bits. We present ...
Improved Approximate String Matching Using Compressed Suffix Data Structures
Approximate string matching is about finding a given string pattern in a text by allowing some degree of errors. In this paper we present a space efficient data structure to solve the 1-mismatch and 1-difference problems. Given a text T of length n over ...
Statistical encoding of succinct data structures
CPM'06: Proceedings of the 17th Annual conference on Combinatorial Pattern MatchingIn recent work, Sadakane and Grossi [SODA 2006] introduced a scheme to represent any sequence S=s1s2...sn, over an alphabet of size σ, using $nH_k(S)+O(\frac{n}{\log_\sigma n} (k \log \sigma + \log\log n))$ bits of space, where Hk(S) is the k-th order ...