Homesearch
Services
Industries
About
Partnerships
Insights
Careers
careers logo
We are looking for the best
Are you one of the top 10% in your field? Do you have a passion for technology and want to make a difference? If so, we are looking for you!
DISCOVER OPENINGS
Investors
arrows logo
NASDAQ CM: GDYN
$21.06
Jan 17, 2025 4:00 PM EST
Get in touch
search
Home Insights All authors Konstantin Perikov
Konstantin Perikov

Konstantin Perikov

Konstantin Perikov is a Search Architect and Senior Software Engineer with a degree in Applied Mathematics. He graduated from Tomsk State University in 2011 with a degree in Applied Mathematics. He joined Grid Dynamics in 2012.

Check out the latest insights:

Filters
Articles
Case studies
Demos
Ebooks
Media and News
Newsletters
Solution briefs
Videos
White papers
Clear All Apply
Artificial intelligence
Computer vision
Generative AI
Cloud platform and product engineering
Cloud platform and dev tools
Quality and performance engineering
Digital engagement
Omnichannel commerce engineering
Show More Show Less
Clear All Apply
Clear All Apply
How to use suffix arrays to combat common limitations of full-text search
Article How to use suffix arrays to combat common limitations of full-text search
Implementing autocomplete with Solr
Article Implementing autocomplete with Solr
show more

Get in touch

Let's connect! How can we reach you?

    Invalid phone format
    Please fill out this field.
    Submitting

    Please follow up to email alerts if you would like to receive information related to press releases, investors relations, and regulatory filings.

    This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

    How to use suffix arrays to combat common limitations of full-text search

    Thank you!

    It is very important to be in touch with you.
    We will get back to you soon. Have a great day!

    check

    Something went wrong...

    There are possible difficulties with connection or other issues.
    Please try again after some time.

    Retry