Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Sardinas–Patterson algorithm

Known as: Sardinas-Patterson algorithm 
In coding theory, the Sardinas–Patterson algorithm is a classical algorithm for determining in polynomial time whether a given variable-length code… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
The professional knowledge base is replete with theoretical postulations, research ndings, and practitioner re ections on school… Expand
2017
2017
The current work presents a novel methodology for the experimental quantification of the crack tip plastic zone during fatigue… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2016
2016
El  Taita Carmelo Sardina Ullpu es profesor de idioma quechua y cosmovision andina en Buenos Aires, lugar donde reside… Expand
2013
2013
This work provides new experimental data of speed of sound and density for seven pure components of pyrolysis bio-oil at… Expand
  • table 1
  • table 2
  • table 2
  • figure 1
  • figure 2
2007
2007
An investigation of the natural convection boundary layer adjacent to an inclined semi-infinite plate subject to a temperature… Expand
  • figure 1
  • figure 2
  • figure 3
2006
2006
The canonical coding partition of a set of words is the finest partition such that the words contained in at least two… Expand
  • figure 1
  • figure 2
  • figure 3
2006
2006
  • S. Ooi
  • 2006
  • Corpus ID: 117625693
This dissertation focuses on the analysis of lock-exchange gravity-driven flows at high Grashof numbers using highly resolved… Expand
Highly Cited
1999
Highly Cited
1999
High school students reported separately on mothers and fathers' responsiveness and demandingness and their own academic… Expand
  • table 2
1991
1991
Having judged 20 upright faces for intelligence (n = 18) or for spectacles (n = 14), subjects were given a recognition test in… Expand
1984
1984
We consider the following problem: Given a set Γ = {c1,...,cn} of nonempty strings over a fixed, finite alphabet Σ, is every… Expand
  • figure 2.1
  • figure 2.2