dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Costas S. Iliopoulos Home Page Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
165Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichalis Christou, Maxime Crochemore, Costas S. Iliopoulos: Quasiperiodicities in Fibonacci strings CoRR abs/1201.6162: (2012)
164Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Mirka Miller, Solon P. Pissis: Parallel Algorithms for Mapping Short degenerate and Weighted DNA Sequences to a Reference genome. Int. J. Found. Comput. Sci. 23(2): 249-259 (2012)
163Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Derrick G. Kourie, Laurent Mouchard, Themba K. Musombuka, Solon P. Pissis, Corné de Ridder: An algorithm for mapping short reads to a dynamically changing genomic sequence. J. Discrete Algorithms 10: 15-22 (2012)
162Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen: Efficient algorithms for three variants of the LPF table. J. Discrete Algorithms 11: 51-61 (2012)
2011
161Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, William F. Smyth: Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers Springer 2011
160Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, William F. Smyth: Combinatorial Algorithms - 22nd International Workshop, IWOCA 2011, Victoria, BC, Canada, July 20-22, 2011, Revised Selected Papers Springer 2011
159Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis: Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. CIAA 2011: 273-281
158Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis: On the Right-Seed Array of a String. COCOON 2011: 492-502
157Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen: Efficient Seeds Computation Revisited. CPM 2011: 350-363
156Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis: Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS 2011: 899-902
155Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis: Computing All Subtree Repeats in Ordered Ranked Trees. SPIRE 2011: 338-343
154Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen: Efficient Seeds Computation Revisited CoRR abs/1104.3153: (2011)
153Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Manal Mohamed, William F. Smyth: New complexity results for the k-covers problem. Inf. Sci. 181(12): 2571-2575 (2011)
152Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOudone Phanalasy, Mirka Miller, Costas S. Iliopoulos, Solon P. Pissis, Elaheh Vaezpour: Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs. Mathematics in Computer Science 5(1): 81-87 (2011)
2010
151Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHui Zhang, Qing Guo, Costas S. Iliopoulos: Varieties of Regularities in Weighted Sequences. AAIM 2010: 271-280
150Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis: A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches. Algorithms and Applications 2010: 92-101
149Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKimon Frousios, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis, German Tischler: REAL: an efficient REad ALigner for next generation sequencing reads. BCB 2010: 154-159
148Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Flouri, Jan Holub, Costas S. Iliopoulos, Solon P. Pissis: An algorithm for mapping short reads to a dynamically changing genomic sequence. BIBM 2010: 133-136
147no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulien Allali, Pascal Ferraro, Costas S. Iliopoulos, Spiros Michalakopoulos: Combinatorial Detection of Arrhythmia. BIOSIGNALS 2010: 180-187
146Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHui Zhang, Qing Guo, Costas S. Iliopoulos: An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences. CIAC 2010: 335-346
145Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler: Cover Array String Reconstruction. CPM 2010: 251-259
144Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Marek Cygan, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen: Algorithms for Three Versions of the Shortest Common Superstring Problem. CPM 2010: 299-309
143Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKaichun K. Chang, Jyh-Shing Roger Jang, Costas S. Iliopoulos: Music Genre Classification via Compressive Sampling. ISMIR 2010: 387-392
142Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen: On the Maximal Number of Cubic Runs in a String. LATA 2010: 227-238
141Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Spiros Michalakopoulos: Combinatorial ECG analysis for mobile devices. Multimedia Information Retrieval 2010: 409-412
140Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen: Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. SOFSEM 2010: 296-307
139Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen: Extracting Powers and Periods in a String from Its Runs Structure. SPIRE 2010: 258-269
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Marcin Kubica, Tomasz Walen, Costas S. Iliopoulos, M. Sohel Rahman: Finding Patterns In Given Intervals. Fundam. Inform. 101(3): 173-186 (2010)
137Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndreas Alexander Albrecht, Alexander V. Chaskin, Costas S. Iliopoulos, Oktay M. Kasim-Zade, Georgios Lappas, Kathleen Steinhöfel: A Note on a priori Estimations of Classification Circuit Complexity. Fundam. Inform. 104(3): 201-217 (2010)
136Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera: Number of Occurrences of powers in Strings. Int. J. Found. Comput. Sci. 21(4): 535-547 (2010)
135Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner: Finite automata based algorithms on subsequences and supersequences of degenerate strings. J. Discrete Algorithms 8(2): 117-130 (2010)
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManolis Christodoulakis, Costas S. Iliopoulos: Foreword. Mathematics in Computer Science 3(4): 371 (2010)
2009
133Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavlos Antoniou, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis: Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. IJCBS 2009: 174-180
132Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Lucian Ilie, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Walen: LPF Computation Revisited. IWOCA 2009: 158-169
131Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulien Allali, Pavlos Antoniou, Costas S. Iliopoulos, Pascal Ferraro, Manal Mohamed: Validation and Decomposition of Partially Occluded Images with Holes. Stringology 2009: 129-136
130Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Mirka Miller, Solon P. Pissis: Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. Stringology 2009: 249-262
129Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, M. Sohel Rahman: Indexing Factors with Gaps. Algorithmica 55(1): 60-70 (2009)
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen: On the maximal number of highly periodic runs in a string CoRR abs/0907.2157: (2009)
127Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, William F. Smyth, Munina Yusufu: Faster Algorithms for Computing Maximal Multirepeats in Multiple Sequences. Fundam. Inform. 97(3): 311-320 (2009)
126Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulien Allali, Pascal Ferraro, Pierre Hanna, Costas S. Iliopoulos, Matthias Robine: Toward a General Framework for Polyphonic Comparison. Fundam. Inform. 97(3): 331-346 (2009)
125Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavlos Antoniou, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis: Algorithms for mapping short degenerate and weighted sequences to a reference genome. I. J. Computational Biology and Drug Design 2(4): 385-397 (2009)
124Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Wojciech Rytter: Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore. Theor. Comput. Sci. 410(43): 4293-4294 (2009)
123Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Mohammad Sohel Rahman: A New Efficient Algorithm for Computing the Longest Common Subsequence. Theory Comput. Syst. 45(2): 355-371 (2009)
2008
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomás Flouri, Costas S. Iliopoulos, Mohammad Sohel Rahman, Ladislav Vagner, Michal Vorácek: Indexing Factors in DNA/RNA Sequences. BIRD 2008: 436-445
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavlos Antoniou, Costas S. Iliopoulos, Inuka Jayasekera, M. Sohel Rahman: Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model. BIRD 2008: 446-455
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Szilárd Zsolt Fazekas, Costas S. Iliopoulos, Inuka Jayasekera: Bounds on Powers in Strings. Developments in Language Theory 2008: 206-215
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, M. Sohel Rahman: A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. SOFSEM 2008: 316-327
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Mohammad Sohel Rahman, Tomasz Walen: Improved Algorithms for the Range Next Value Problem and Applications. STACS 2008: 205-216
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Inuka Jayasekera, Gad M. Landau: Conservative String Covering of Indeterminate Strings. Stringology 2008: 108-115
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, M. Sohel Rahman: Indexing Circular Patterns. WALCOM 2008: 46-57
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKangho Roh, Maxime Crochemore, Costas S. Iliopoulos, Kunsoo Park: External Memory Algorithms for String Problems. Fundam. Inform. 84(1): 17-32 (2008)
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHui Zhang, Qing Guo, Costas S. Iliopoulos: Algorithms for Computing the lambda-regularities in Strings. Fundam. Inform. 84(1): 33-49 (2008)
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Mohammad Sohel Rahman: Faster index for property matching. Inf. Process. Lett. 105(6): 218-223 (2008)
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Mohammad Sohel Rahman: New efficient algorithms for the LCS and constrained LCS problems. Inf. Process. Lett. 106(1): 13-18 (2008)
111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman: Optimal prefix and suffix queries on texts. Inf. Process. Lett. 108(5): 320-325 (2008)
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHui Zhang, Qing Guo, Costas S. Iliopoulos: Generalized approximate regularities in strings. Int. J. Comput. Math. 85(2): 155-168 (2008)
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth: Identifying Rhythms in Musical Texts. Int. J. Found. Comput. Sci. 19(1): 37-51 (2008)
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Mirka Miller: Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia. J. Discrete Algorithms 6(1): 1-2 (2008)
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Laurent Mouchard, Mohammad Sohel Rahman: A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching. Mathematics in Computer Science 1(4): 557-569 (2008)
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, M. Sohel Rahman: Algorithms for computing variants of the longest common subsequence problem. Theor. Comput. Sci. 395(2-3): 255-267 (2008)
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang: Property matching and weighted matching. Theor. Comput. Sci. 395(2-3): 298-310 (2008)
2007
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLM. Sohel Rahman, Costas S. Iliopoulos: A New Efficient Algorithm for Computing the Longest Common Subsequence. AAIM 2007: 82-90
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner: The Constrained Longest Common Subsequence Problem for Degenerate Strings. CIAA 2007: 309-311
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen: Algorithms for Computing the Longest Parameterized Common Subsequence. CPM 2007: 265-273
101no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Inuka Jayasekera, Borivoj Melichar, Jan Supol: Weighted Degenerated Approximate Pattern Matching. LATA 2007: 285-296
100no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavlos Antoniou, Maxime Crochemore, Costas S. Iliopoulos, Pierre Peterlongo: Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. LATA 2007: 57-66
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman: Finding Patterns in Given Intervals. MFCS 2007: 645-656
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLInbok Lee, Costas S. Iliopoulos, Syng-Yup Ohn: Transformation of Suffix Arrays into Suffix Trees on the MPI Environment. RSFDGrC 2007: 248-255
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLM. Sohel Rahman, Costas S. Iliopoulos: Indexing Factors with Gaps. SOFSEM (1) 2007: 465-474
96no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLM. Sohel Rahman, Costas S. Iliopoulos: Pattern Matching Algorithms with Don't Cares. SOFSEM (2) 2007: 116-126
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJulien Allali, Pascal Ferraro, Pierre Hanna, Costas S. Iliopoulos: Local Transpositions in Alignment of Polyphonic Musical Sequences. SPIRE 2007: 26-38
94no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLM. Sohel Rahman, Costas S. Iliopoulos, Laurent Mouchard: Pattern Matching in Degenerate DNA/RNA Sequences. WALCOM 2007: 109-120
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLA. Bakalis, Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas: Locating Maximal Multirepeats in Multiple Strings Under Various Constraints. Comput. J. 50(2): 178-185 (2007)
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQing Guo, Hui Zhang, Costas S. Iliopoulos: Computing the lambda-covers of a string. Inf. Sci. 177(19): 3957-3967 (2007)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot: All maximal-pairs in step-leap representation of melodic sequence. Inf. Sci. 177(9): 1954-1962 (2007)
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas: Algorithms for extracting motifs from biological weighted sequences. J. Discrete Algorithms 5(2): 229-242 (2007)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLInbok Lee, Costas S. Iliopoulos, Kunsoo Park: Linear time algorithm for the longest common repeat problem. J. Discrete Algorithms 5(2): 243-249 (2007)
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManolis Christodoulakis, G. Brian Golding, Costas S. Iliopoulos, Yoan José Pinzón Ardila, William F. Smyth: Efficient Algorithms for Counting and Reporting Segregating Sites in Genomic Sequences. Journal of Computational Biology 14(7): 1001-1010 (2007)
2006
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQing Guo, Hui Zhang, Costas S. Iliopoulos: Computing the lambda-Seeds of a String. AAIM 2006: 303-313
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo: Finding Common Motifs with Gaps Using Finite Automata. CIAA 2006: 69-77
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLM. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth: Finding Patterns with Variable Length Gaps or Don't Cares. COCOON 2006: 146-155
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang: Property Matching and Weighted Matching. CPM 2006: 188-199
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat: Approximate Matching in Weighted Sequences. CPM 2006: 365-376
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLM. Sohel Rahman, Costas S. Iliopoulos: Algorithms for Computing Variants of the Longest Common Subsequence Problem. ISAAC 2006: 399-408
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManolis Christodoulakis, Costas S. Iliopoulos, Yoan José Pinzón Ardila: Simple Algorithm for Sorting the Fibonacci String Rotations. SOFSEM 2006: 218-225
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQing Guo, Hui Zhang, Costas S. Iliopoulos: Computing the Minimum Approximate lambda-Cover of a String. SPIRE 2006: 49-60
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth: Song classifications for dancing. Stringology 2006: 41-48
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis: The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications. Fundam. Inform. 71(2-3): 259-277 (2006)
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManolis Christodoulakis, Costas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis, Kostas Tsichlas: Computation of Repetitions and Regularities of Biologically Weighted Sequences. Journal of Computational Biology 13(6): 1214-1231 (2006)
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot: Longest repeats with a block of k don't cares. Theor. Comput. Sci. 362(1-3): 248-254 (2006)
2005
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Clifford, Raphaël Clifford, Costas S. Iliopoulos: Faster Algorithms for delta, gamma-Matching and Related Problems. CPM 2005: 68-78
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot: A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. ISMIR 2005: 167-174
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeremy Pickens, Costas S. Iliopoulos: Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval. ISMIR 2005: 207-214
72no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed: Approximation algorithm for the cyclic swap problem. Stringology 2005: 190-200
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot: A first approach to finding common motifs with gaps. Int. J. Found. Comput. Sci. 16(6): 1145-1154 (2005)
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon, Alejandro Salinger: Bit-parallel (delta, gamma)-matching and suffix automata. J. Discrete Algorithms 3(2-4): 198-214 (2005)
69no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim: Approximate Seeds of Strings. Journal of Automata, Languages and Combinatorics 10(5/6): 609-626 (2005)
68no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Cole, Costas S. Iliopoulos, Manal Mohamed, William F. Smyth, L. Yang: The Complexity of the Minimum k-Cover Problem. Journal of Automata, Languages and Combinatorics 10(5/6): 641-653 (2005)
67no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Laurent Mouchard, Katerina Perdikuri, Athanasios K. Tsakalidis: Computing the Repetitions in a Biological Weighted Sequence. Journal of Automata, Languages and Combinatorics 10(5/6): 687-696 (2005)
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLManolis Christodoulakis, Costas S. Iliopoulos, Kunsoo Park, Jeong Seop Sim: Implementing approximate regularities. Mathematical and Computer Modelling 42(7-8): 855-866 (2005)
2004
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Thierry Lecroq: String Algorithmics. College Publications 2004
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHui Zhang, Qing Guo, Costas S. Iliopoulos: String Matching with Swaps in a Weighted Sequence. CIS 2004: 698-704
63no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis: Efficient Algorithms for Handling Molecular Weighted Sequences. IFIP TCS 2004: 265-278
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot: Longest Repeats with a Block of Don't Cares. LATIN 2004: 271-278
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLInbok Lee, Costas S. Iliopoulos, Kunsoo Park: Linear Time Algorithm for the Longest Common Repeat Problem. SPIRE 2004: 10-17
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas: Motif Extraction from Weighted Sequences. SPIRE 2004: 286-297
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot: A First Approach to Finding Common Motifs With Gaps. Stringology 2004: 88-97
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRaphaël Clifford, Costas S. Iliopoulos: Approximate string matching for music analysis. Soft Comput. 8(9): 597-603 (2004)
2003
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon: A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. SPIRE 2003: 211-223
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq: Occurrence and Substring Heuristics for i-Matching. Fundam. Inform. 56(1-2): 1-21 (2003)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon: Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. Fundam. Inform. 56(1-2): 89-103 (2003)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter: On special families of morphisms related to [delta]-matching and don't care symbols. Inf. Process. Lett. 85(5): 227-233 (2003)
53no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDiane Donovan, Costas S. Iliopoulos, Mirka Miller: Editorial. Journal of Automata, Languages and Combinatorics 8(4): 555 (2003)
52no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis: String Regularities with Don't Cares. Nord. J. Comput. 10(1): 40-51 (2003)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park: Truncated suffix trees and their application to data compression. Theor. Comput. Sci. 1-3(304): 87-101 (2003)
2002
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas: Identifying Occurrences of Maximal Pairs in Multiple Strings. CPM 2002: 133-143
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter: Three Heuristics for delta-Matching: delta-BM Algorithms. CPM 2002: 178-189
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Manal Mohamed: Validation and Decomposition of Partially Occluded Images. SOFSEM 2002: 218-230
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon: Algorithms for Computing Approximate Repetitions in Musical Sequences. Int. J. Comput. Math. 79(11): 1135-1148 (2002)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAspassia Daskalopulu, Costas S. Iliopoulos, Manal Mohamed: On-Line Analysis and Validation of Partially Occluded Images: Implementation and Practice. Int. J. Comput. Math. 79(12): 1245-1257 (2002)
45no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, T. Tsichlas: Approximate String Matching with Gaps. Nord. J. Comput. 9(1): 54-65 (2002)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Yoan J. Pinzon: Recovering an LCS in O(n2/w) Time and Space. Revista Colombiana de Computación 3(1): 41-51 (2002)
2001
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon: The Max-Shift Algorithm for Approximate String Matching. Algorithm Engineering 2001: 13-25
42no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon: Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. SPIRE 2001: 59-67
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTim Crawford, Costas S. Iliopoulos, Russel L. Winder, Haifeng Yu: Approximate Musical Evolution. Computers and the Humanities 35(1): 55-64 (2001)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmilios Cambouropoulos, Tim Crawford, Costas S. Iliopoulos: Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects. Computers and the Humanities 35(1): 9-21 (2001)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon: Computing Evolutionary Chains in Musical Sequences. Electr. J. Comb. 8(2): (2001)
38no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, James F. Reid: Decomposition of Partially Occluded Strings in the Presence of Errors. IJPRAI 15(7): 1129-1142 (2001)
37no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard: Distributed Pattern Matching Using Finite Automata. Journal of Automata, Languages and Combinatorics 6(2): 191-204 (2001)
36no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Jamie Simpson: On-Line Validation and Analysis of Partially Occluded Images. Journal of Automata, Languages and Combinatorics 6(3): 291-303 (2001)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth: Approximate periods of strings. Theor. Comput. Sci. 262(1): 557-568 (2001)
2000
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon: Finding Motifs with Gaps. ISMIR 2000
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon: Fast Evolutionary Chains. SOFSEM 2000: 307-318
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, James F. Reid: Optimal parallel analysis and decomposition of partially occluded strings. Parallel Computing 26(4): 483-494 (2000)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos: Combinatorial Algorithms - Preface. Theor. Comput. Sci. 249(2): 241 (2000)
1999
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth: Approximate Periods of Strings. CPM 1999: 123-133
29no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Laurent Mouchard: Quasiperiodicity: From Detection to Normal Forms. Journal of Automata, Languages and Combinatorics 4(3): 213-228 (1999)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Laurent Mouchard: Quasiperiodicity and String Covering. Theor. Comput. Sci. 218(1): 205-216 (1999)
1998
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Maureen Korda: Massively Parallel Suffix Array Construction. SOFSEM 1998: 371-380
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaxime Crochemore, Costas S. Iliopoulos, Maureen Korda: Two-Dimensional Prefix String Matching and Covering on Square Matrices. Algorithmica 20(4): 353-373 (1998)
1997
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Dennis Moore, William F. Smyth: A Characterization of the Squares in a Fibonacci String. Theor. Comput. Sci. 172(1-2): 281-291 (1997)
1996
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, D. W. G. Moore, Kunsoo Park: Covering a String. Algorithmica 16(3): 288-297 (1996)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClive N. Galley, Costas S. Iliopoulos: A Pram Algorithm for a Special Case of the Set Partition Problem. Parallel Algorithms Appl. 10(1-2): 105-109 (1996)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Maureen Korda: Optimal Parallel Superprimitivity Testing for Square Arrays. Parallel Processing Letters 6(3): 299-308 (1996)
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Kunsoo Park: A Work-Time Optimal Algorithm for Computing All String Covers. Theor. Comput. Sci. 164(1&2): 299-310 (1996)
1995
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOmer Berkman, Costas S. Iliopoulos, Kunsoo Park: The Subtree Max Gap Problem with Application to Parallel String Covering. Inf. Comput. 123(1): 127-137 (1995)
1994
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park: The Subtree Max Gap Problem with Application to Parallel String Covering. SODA 1994: 501-510
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLClive N. Galley, Costas S. Iliopoulos: A Simple Parallel Algorithm for the Single Function Coarsest Partition Problem. Parallel Processing Letters 4: 437-445 (1994)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth: Parallel RAM Algorithms for Factorizing Words. Theor. Comput. Sci. 127(1): 53-67 (1994)
1993
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, Dennis Moore, Kunsoo Park: Covering a String. CPM 1993: 54-62
1992
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, William F. Smyth: Optimal Algorithms for Computing the canonical form of a circular string. Theor. Comput. Sci. 92(1): 87-105 (1992)
1991
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlberto Apostolico, Martin Farach, Costas S. Iliopoulos: Optimal Superprimitivity Testing for Strings. Inf. Process. Lett. 39(1): 17-20 (1991)
1989
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos, William F. Smyth: PRAM Algorithms for Identifying Polygon Similarity. Optimal Algorithms 1989: 25-32
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix. SIAM J. Comput. 18(4): 658-669 (1989)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos: Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations. SIAM J. Comput. 18(4): 670-678 (1989)
1988
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin: Parallel Construction of a Suffix Tree with Applications. Algorithmica 3: 347-365 (1988)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos: On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems. Theor. Comput. Sci. 56: 211-222 (1988)
1987
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlberto Apostolico, Costas S. Iliopoulos, Robert Paige: On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem. Parallel Algorithms and Architectures 1987: 70-76
1986
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos: Monte Carlo Circuits for the Abelian Permutation Group Intersection Problem. Acta Inf. 23(6): 697-705 (1986)
1985
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos: Worst-Case Analysis of Algorithms for Computational Problems on Abelian Permutation Groups. European Conference on Computer Algebra (2) 1985: 225-228
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos: Gaussian Elimination over a Euclidean Ring. European Conference on Computer Algebra (2) 1985: 29-30
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLW. M. Beynon, Costas S. Iliopoulos: Computing a Basis for a Finite Abelian p-Group. Inf. Process. Lett. 20(3): 161-163 (1985)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos: Analysis of Algorithms on Problems in General Abelian Groups. Inf. Process. Lett. 20(4): 215-220 (1985)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos: Computing in General Abelian Groups is Hard. Theor. Comput. Sci. 41: 81-93 (1985)
1982
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCostas S. Iliopoulos: Analysis of an Algorithm for Composition of Binary Quadratic Forms. J. Algorithms 3(2): 157-159 (1982)

Coauthor Index

1Andreas Alexander Albrecht [137]
2Julien Allali [95] [126] [131] [147]
3Amihood Amir [83] [84] [105]
4Pavlos Antoniou [86] [100] [117] [121] [125] [131] [133]
5Alberto Apostolico [8] [10] [14] [51]
6A. Bakalis [93]
7Amir M. Ben-Amram [19]
8Omer Berkman [19] [20]
9W. M. Beynon [4]
10Emilios Cambouropoulos [40] [47] [74] [91]
11Kaichun K. Chang [143]
12Alexander V. Chaskin [137]
13Eran Chencinski [84] [105]
14Manolis Christodoulakis [66] [69] [77] [79] [81] [88] [109] [134]
15Michalis Christou [154] [155] [157] [158] [165]
16Peter Clifford [75]
17Raphaël Clifford [58] [75]
18Richard Cole [54] [68]
19Tim Crawford [40] [41]
20Maxime Crochemore [26] [33] [34] [39] [42] [45] [47] [49] [55] [56] [57] [62] [70] [74] [76] [91] [99] [100] [111] [115] [117] [118] [120] [128] [132] [136] [138] [139] [140] [142] [144] [145] [150] [154] [155] [157] [158] [162] [165]
21Marek Cygan [144]
22Aspassia Daskalopulu [46]
23Jacqueline W. Daykin [17]
24Diane Donovan (Diane M. Donovan) [53]
25Martin Farach-Colton (Martin Farach) [14]
26Szilárd Zsolt Fazekas [120] [136]
27Pascal Ferraro [95] [126] [131] [147]
28Tomás Flouri [122] [148] [155] [156] [159]
29Kimon Frousios [149]
30Clive N. Galley [18] [23]
31G. Brian Golding [88]
32Qing Guo [64] [80] [87] [92] [110] [114] [146] [151]
33Ondrej Guth [158]
34Pierre Hanna [95] [126]
35Jan Holub [37] [86] [148]
36Lucian Ilie [132]
37Jyh-Shing Roger Jang [143]
38Jan Janousek [155] [156] [159]
39Inuka Jayasekera [101] [117] [120] [121] [136]
40Oren Kapah [83]
41Oktay M. Kasim-Zade [137]
42Tsvi Kopelowitz [84] [105]
43Maureen Korda [22] [26] [27]
44Derrick G. Kourie [163]
45Marcin Kubica [102] [118] [128] [132] [138] [139] [140] [142] [144] [154] [157] [162]
46Gad M. Landau [10] [72] [117]
47Georgios Lappas [137]
48Thierry Lecroq [49] [54] [56] [65]
49Inbok Lee [61] [85] [89] [98]
50Christos Makris [45] [50] [63] [78] [93]
51James A. M. McHugh [59] [71]
52Borivoj Melichar [37] [86] [101] [155] [156] [159]
53Spiros Michalakopoulos [141] [147]
54Mirka Miller [53] [108] [130] [152] [164]
55Manal Mohamed [46] [48] [52] [62] [68] [72] [74] [76] [85] [91] [131] [153]
56D. W. G. Moore [24]
57Dennis Moore [16] [25]
58Laurent Mouchard [28] [29] [37] [43] [47] [52] [67] [77] [94] [107] [125] [133] [149] [163]
59Themba K. Musombuka [163]
60Joong Chae Na [51]
61Gonzalo Navarro [57] [70]
62Syng-Yup Ohn [98]
63Robert Paige [8]
64Yannis Panagis [63] [78]
65Kunsoo Park [16] [19] [20] [21] [24] [30] [35] [51] [61] [66] [69] [89] [115]
66Katerina Perdikuri [52] [60] [63] [67] [77] [78] [90]
67Pierre Peterlongo [59] [71] [86] [100]
68Oudone Phanalasy [152]
69Jeremy Pickens [73]
70Yoan J. Pinzon (Yoan José Pinzón Ardila) [33] [34] [39] [42] [43] [44] [47] [55] [57] [70] [72] [81] [88]
71Nadia Pisanti [59] [71]
72Solon P. Pissis [125] [130] [133] [145] [148] [149] [150] [152] [154] [155] [156] [157] [158] [159] [163] [164]
73Wojciech Plandowski [49] [54]
74Ely Porat [83]
75Jakub Radoszewski [128] [139] [142] [144] [154] [157]
76Mohammad Sohel Rahman (M. Sohel Rahman) [79] [82] [85] [94] [96] [97] [99] [102] [103] [104] [106] [107] [109] [111] [112] [113] [116] [118] [119] [121] [122] [123] [129] [135] [138]
77James F. Reid [32] [38]
78Corné de Ridder [163]
79Matthias Robine [126]
80Kangho Roh [115]
81Wojciech Rytter [45] [49] [54] [59] [71] [124] [128] [132] [139] [140] [142] [144] [154] [157] [162]
82Marie-France Sagot [59] [62] [71] [74] [76] [91]
83Alejandro Salinger [70]
84Baruch Schieber [10]
85Jeong Seop Sim [30] [35] [66] [69]
86Jamie Simpson [36]
87Spyros Sioutas [50] [93]
88William F. Smyth (Bill Smyth) [13] [15] [17] [25] [30] [35] [52] [68] [79] [85] [88] [109] [127] [153] [160] [161]
89Kathleen Steinhöfel [137]
90Jan Supol [101]
91Bartosz Szreder [154] [157]
92Evangelos Theodoridis (Vangelis Theodoridis) [60] [63] [78] [90] [93]
93German Tischler [145] [149]
94Athanasios K. Tsakalidis [45] [50] [52] [60] [63] [67] [77] [78] [90] [93]
95Kostas Tsichlas [50] [60] [77] [90] [93]
96T. Tsichlas [45]
97Elaheh Vaezpour [152]
98Ladislav Vagner [103] [122] [135]
99Uzi Vishkin [10]
100Michal Vorácek [103] [122] [135]
101Tomasz Walen [102] [118] [128] [132] [138] [139] [140] [142] [144] [154] [157] [162]
102Russel L. Winder [41]
103L. Yang [68]
104Haifeng Yu [41]
105Munina Yusufu [127]
106Hui Zhang [64] [80] [84] [87] [92] [105] [110] [114] [146] [151]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page