scispace - formally typeset
Search or ask a question
Topic

String (computer science)

About: String (computer science) is a research topic. Over the lifetime, 19430 publications have been published within this topic receiving 333247 citations. The topic is also known as: str & s.


Papers
More filters
Patent
25 Mar 1993
TL;DR: In this paper, a method and system for providing a language-sensitive text search that performs text comparison of any Unicode strings is presented. But this method is limited to the case where the string is examined and a compare is performed one or more characters at a time based on a predefined character precedence.
Abstract: A method and system for providing a language-sensitive text search that performs text comparison of any Unicode strings. For any language an ordering is defined based on features of the language. Then, an interactive compare function is performed to determine the relationship of a pair of strings. The string is examined and a compare is performed one or more characters at a time based on a predefined character precedence.

164 citations

Journal ArticleDOI
TL;DR: This work considers the special case where the legitimate partners already share a mutual string which might, however, be partially known to the adversary, and proposes two protocols, one based on universal hashing and onebased on extractors, allowing for privacy amplification secure against an adversary whose knowledge about the initial partially secret string is limited to one third of the length of this string.
Abstract: For pt. II see ibid., vol.49, no.4, p.832-38 (2003). Here, we consider the special case where the legitimate partners already share a mutual string which might, however, be partially known to the adversary. The problem of generating a secret key in this case has been well studied in the passive-adversary model - for instance, in the context of quantum key agreement - under the name of privacy amplification. We consider the same problem with respect to an active adversary and propose two protocols, one based on universal hashing and one based on extractors, allowing for privacy amplification secure against an adversary whose knowledge about the initial partially secret string is limited to one third of the length of this string. Our results are based on novel techniques for authentication secure even against adversaries knowing a substantial amount of the "secret" key.

163 citations

Patent
25 Mar 1993
TL;DR: In this article, a method and system for providing a language-sensitive text compare is presented that performs text comparison of any Unicode strings, and an interactive compare function is performed to determine the relationship of a pair of strings.
Abstract: A method and system for providing a language-sensitive text compare. An innovative system and method for performing the compare is presented that performs text comparison of any Unicode strings. For any language an ordering is defined based on features of the language. Then, an interactive compare function is performed to determine the relationship of a pair of strings. The string is examined and a compare is performed one character at a time based on a predefined character precedence.

163 citations

Proceedings ArticleDOI
09 Jul 2007
TL;DR: It is shown that string stability can be achieved for heterogeneous vehicle strings of arbitrary length and arbitrary vehicle type ordering, and the necessary and sufficient conditions forheterogeneous string stability are given for the constant spacing leader-predecessor following control strategy.
Abstract: The spacing errors of a string stable, homogeneous vehicle string attenuate uniformly down the vehicle chain. This result is useful for implementing vehicle formation control because it provides a guideline for the proper intervehicle spacing. In the heterogeneous case, the differing dynamics of the vehicles means the spacing errors do not attenuate or amplify uniformly down the vehicle chain, regardless of whether the formation is string stable or not. Questions arise regarding how heterogeneous string stability should be defined, and what should the proper intervehicle spacing be in order to guarantee nominal safety. In this paper, heterogeneous vehicle strings under simple decentralized control laws with the constant spacing control policy are analyzed. A definition for heterogeneous string stability is proposed. The necessary and sufficient conditions for heterogeneous string stability are given for the constant spacing leader-predecessor following control strategy. The scalability of the control scheme is verified by analyzing the worst case disturbance to error gain. It is shown that string stability can be achieved for heterogeneous vehicle strings of arbitrary length and arbitrary vehicle type ordering.

163 citations

Patent
Victor S. Miller1, Mark N. Wegman1
11 Aug 1986
TL;DR: In this paper, a data compression method for communications between a host computing system and a number of remote terminals is enhanced by adding new character and string extensions to improve the compression ratio and deletion of a least recently used routine.
Abstract: Communications between a Host Computing System and a number of remote terminals is enhanced by a data compression method which modifies the data compression method of Lempel and Ziv by addition of new character and new string extensions to improve the compression ratio, and deletion of a least recently used routine to limit the encoding tables to a fixed size to significantly improve data transmission efficiency.

162 citations


Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
88% related
Tree (data structure)
44.9K papers, 749.6K citations
86% related
Graph (abstract data type)
69.9K papers, 1.2M citations
85% related
Computational complexity theory
30.8K papers, 711.2K citations
82% related
Supervised learning
20.8K papers, 710.5K citations
80% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20222
2021491
2020704
2019759
2018816
2017806