Stop the war!
Остановите войну!
for scientists:
default search action
"Searching a Bitstream in Linear Time for the Longest Substring of Any ..."
Benjamin A. Burton (2011)
- Benjamin A. Burton:
Searching a Bitstream in Linear Time for the Longest Substring of Any Given Density. Algorithmica 61(3): 555-579 (2011)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.