Content deleted Content added
ChristieBot (talk | contribs) m Add good article icon |
Citation bot (talk | contribs) Alter: title. Add: isbn. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | #UCB_webform_linked 116/1109 Tag: Reverted |
||
Line 102:
| title = STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings
| volume = 3884
| isbn = 978-3-540-32301-3
| year = 2006}}
*{{citation|contribution=On Cartesian trees and range minimum queries|first1=Erik D.|last1=Demaine|author1-link=Erik Demaine|first2=Gad M.|last2=Landau|first3=Oren|last3=Weimann|series=Lecture Notes in Computer Science|volume=5555|year=2009|pages=341–353|doi=10.1007/978-3-642-02927-1_29|title=Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009|isbn=978-3-642-02926-4|hdl=1721.1/61963|hdl-access=free}}
Line 107 ⟶ 108:
| last1 = Fischer | first1 = Johannes
| last2 = Heun | first2 = Volker
| contribution = Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
▲ | title = Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching
| publisher = Springer-Verlag
| series = Lecture Notes in Computer Science
Line 119 ⟶ 120:
| last1 = Fischer | first1 = Johannes
| last2 = Heun | first2 = Volker
| title =
| contribution = A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array.
▲ | title = Proceedings of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
| publisher = Springer-Verlag
| series = Lecture Notes in Computer Science
Line 131 ⟶ 132:
| last1 = Gabow | first1 = Harold N. | author1-link = Harold N. Gabow
| last2 = Bentley | first2 = Jon Louis | author2-link = Jon Bentley (computer scientist)
| last3 = Tarjan | first3 = Robert E. | title = Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84 | author3-link = Robert Tarjan
| contribution = Scaling and related techniques for geometry problems
| doi = 10.1145/800057.808675
Line 138 ⟶ 139:
| pages = 135–143
| publisher = ACM
| year = 1984| title-link = Symposium on Theory of Computing
| s2cid = 17752833 }}
Line 178:
| last1 = Levcopoulos | first1 = Christos
| last2 = Petersson | first2 = Ola
| contribution = Heapsort - Adapted for Presorted Files
| doi = 10.1007/3-540-51542-9_41
Line 184 ⟶ 185:
| publisher = Springer-Verlag
| series = Lecture Notes in Computer Science
▲ | title = WADS '89: Proceedings of the Workshop on Algorithms and Data Structures
| volume = 382
| isbn = 978-3-540-51542-5
| year = 1989}}
*{{citation
Line 202 ⟶ 203:
| title = String Processing and Information Retrieval - 28th International Symposium, SPIRE 2021, Lille, France, October 4-6, 2021, Proceedings
| volume = 12944
| isbn = 978-3-030-86691-4
| year = 2021| s2cid = 235313506
}}
| |||