Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Timothy Ng 0001
@article{DBLP:journals/iandc/HanKNS21,
author = {Yo{-}Sub Han and
Sang{-}Ki Ko and
Timothy Ng and
Kai Salomaa},
title = {Consensus string problem for multiple regular languages},
journal = {Inf. Comput.},
volume = {279},
pages = {104615},
year = {2021},
url = {https://doi.org/10.1016/j.ic.2020.104615},
doi = {10.1016/J.IC.2020.104615},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/HanKNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/KariN21,
author = {Lila Kari and
Timothy Ng},
title = {Descriptional Complexity of Semi-Simple Splicing Systems},
journal = {Int. J. Found. Comput. Sci.},
volume = {32},
number = {6},
pages = {685--711},
year = {2021},
url = {https://doi.org/10.1142/S0129054121420041},
doi = {10.1142/S0129054121420041},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/KariN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/nc/BellamoliFKLNW21,
author = {Francesco Bellamoli and
Giuditta Franco and
Lila Kari and
Silvia Lampis and
Timothy Ng and
Zihao Wang},
title = {Conjugate word blending: formal model and experimental implementation
by {XPCR}},
journal = {Nat. Comput.},
volume = {20},
number = {4},
pages = {647--658},
year = {2021},
url = {https://doi.org/10.1007/s11047-021-09867-x},
doi = {10.1007/S11047-021-09867-X},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/nc/BellamoliFKLNW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HanKNS21,
author = {Yo{-}Sub Han and
Sang{-}Ki Ko and
Timothy Ng and
Kai Salomaa},
title = {Closest substring problems for regular languages},
journal = {Theor. Comput. Sci.},
volume = {862},
pages = {144--154},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2020.09.005},
doi = {10.1016/J.TCS.2020.09.005},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HanKNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/EnagantiKNW20,
author = {Srujan Kumar Enaganti and
Lila Kari and
Timothy Ng and
Zihao Wang},
title = {Word Blending in Formal Languages},
journal = {Fundam. Informaticae},
volume = {171},
number = {1-4},
pages = {151--173},
year = {2020},
url = {https://doi.org/10.3233/FI-2020-1877},
doi = {10.3233/FI-2020-1877},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fuin/EnagantiKNW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/Kari020,
author = {Lila Kari and
Timothy Ng},
editor = {Natasa Jonoska and
Dmytro Savchuk},
title = {Descriptional Complexity of Semi-simple Splicing Systems},
booktitle = {Developments in Language Theory - 24th International Conference, {DLT}
2020, Tampa, FL, USA, May 11-15, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12086},
pages = {150--163},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-48516-0\_12},
doi = {10.1007/978-3-030-48516-0\_12},
timestamp = {Tue, 26 May 2020 17:27:29 +0200},
biburl = {https://dblp.org/rec/conf/dlt/Kari020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/NgRS19,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
title = {State Complexity of Suffix Distance},
journal = {Int. J. Found. Comput. Sci.},
volume = {30},
number = {6-7},
pages = {1197--1216},
year = {2019},
url = {https://doi.org/10.1142/S0129054119400355},
doi = {10.1142/S0129054119400355},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/NgRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/Kari019,
author = {Lila Kari and
Timothy Ng},
editor = {Michal Hospod{\'{a}}r and
Galina Jir{\'{a}}skov{\'{a}} and
Stavros Konstantinidis},
title = {State Complexity of Simple Splicing},
booktitle = {Descriptional Complexity of Formal Systems - 21st {IFIP} {WG} 1.02
International Conference, {DCFS} 2019, Ko{\v{s}}ice, Slovakia, July
17-19, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11612},
pages = {197--209},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-23247-4\_15},
doi = {10.1007/978-3-030-23247-4\_15},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcfs/Kari019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/Kari019,
author = {Lila Kari and
Timothy Ng},
editor = {Carlos Mart{\'{\i}}n{-}Vide and
Alexander Okhotin and
Dana Shapira},
title = {State Complexity of Pseudocatenation},
booktitle = {Language and Automata Theory and Applications - 13th International
Conference, {LATA} 2019, St. Petersburg, Russia, March 26-29, 2019,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11417},
pages = {203--214},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-13435-8\_15},
doi = {10.1007/978-3-030-13435-8\_15},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lata/Kari019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-02512,
author = {Lila Kari and
Timothy Ng},
title = {Descriptional Complexity of Semi-Simple Splicing Systems},
journal = {CoRR},
volume = {abs/1909.02512},
year = {2019},
url = {http://arxiv.org/abs/1909.02512},
eprinttype = {arXiv},
eprint = {1909.02512},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-02512.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/NgRS18,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
title = {State Complexity of Neighbourhoods and Approximate Pattern Matching},
journal = {Int. J. Found. Comput. Sci.},
volume = {29},
number = {2},
pages = {315--329},
year = {2018},
url = {https://doi.org/10.1142/S0129054118400099},
doi = {10.1142/S0129054118400099},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/NgRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/HanK0S18,
author = {Yo{-}Sub Han and
Sang{-}Ki Ko and
Timothy Ng and
Kai Salomaa},
editor = {Mizuho Hoshi and
Shinnosuke Seki},
title = {Closest Substring Problems for Regular Languages},
booktitle = {Developments in Language Theory - 22nd International Conference, {DLT}
2018, Tokyo, Japan, September 10-14, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11088},
pages = {392--403},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-98654-8\_32},
doi = {10.1007/978-3-319-98654-8\_32},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dlt/HanK0S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uc/EnagantiKNW18,
author = {Srujan Kumar Enaganti and
Lila Kari and
Timothy Ng and
Zihao Wang},
editor = {Susan Stepney and
Sergey Verlan},
title = {Word Blending in Formal Languages: The Brangelina Effect},
booktitle = {Unconventional Computation and Natural Computation - 17th International
Conference, {UCNC} 2018, Fontainebleau, France, June 25-29, 2018,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10867},
pages = {72--85},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-92435-9\_6},
doi = {10.1007/978-3-319-92435-9\_6},
timestamp = {Sun, 02 Oct 2022 16:16:37 +0200},
biburl = {https://dblp.org/rec/conf/uc/EnagantiKNW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ca/Ng17,
author = {Timothy Ng},
title = {Distances Between Languages: Algorithms and Descriptional Complexity},
school = {Queen's University at Kingston, Ontario, Canada},
year = {2017},
url = {https://hdl.handle.net/1974/22018},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ca/Ng17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/0001RS17,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
title = {State Complexity of Prefix Distance of Subregular Languages},
journal = {J. Autom. Lang. Comb.},
volume = {22},
number = {1-3},
pages = {169--188},
year = {2017},
url = {https://doi.org/10.25596/jalc-2017-169},
doi = {10.25596/JALC-2017-169},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jalc/0001RS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/NgRS17,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
title = {State complexity of prefix distance},
journal = {Theor. Comput. Sci.},
volume = {679},
pages = {107--117},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2016.05.018},
doi = {10.1016/J.TCS.2016.05.018},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/NgRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoHNS17,
author = {Da{-}Jung Cho and
Yo{-}Sub Han and
Timothy Ng and
Kai Salomaa},
title = {Pseudoknot-generating operation},
journal = {Theor. Comput. Sci.},
volume = {696},
pages = {52--64},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.07.001},
doi = {10.1016/J.TCS.2017.07.001},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoHNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChoHNS17a,
author = {Da{-}Jung Cho and
Yo{-}Sub Han and
Timothy Ng and
Kai Salomaa},
title = {Outfix-guided insertion},
journal = {Theor. Comput. Sci.},
volume = {701},
pages = {70--84},
year = {2017},
url = {https://doi.org/10.1016/j.tcs.2017.03.040},
doi = {10.1016/J.TCS.2017.03.040},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChoHNS17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/0001RS17,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
editor = {Stavros Konstantinidis and
Nelma Moreira and
Rog{\'{e}}rio Reis and
Jeffrey O. Shallit},
title = {Quasi-Distances and Weighted Finite Automata},
booktitle = {The Role of Theory in Computer Science - Essays Dedicated to Janusz
Brzozowski},
pages = {135--152},
publisher = {World Scientific},
year = {2017},
url = {https://doi.org/10.1142/9789813148208\_0006},
doi = {10.1142/9789813148208\_0006},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/0001RS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/0001RS17,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
editor = {Giovanni Pighizzini and
Cezar C{\^{a}}mpeanu},
title = {State Complexity of Suffix Distance},
booktitle = {Descriptional Complexity of Formal Systems - 19th {IFIP} {WG} 1.02
International Conference, {DCFS} 2017, Milano, Italy, July 3-5, 2017,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10316},
pages = {287--298},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-60252-3\_23},
doi = {10.1007/978-3-319-60252-3\_23},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcfs/0001RS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/0001RS17,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
editor = {{\'{E}}milie Charlier and
Julien Leroy and
Michel Rigo},
title = {Relative Prefix Distance Between Languages},
booktitle = {Developments in Language Theory - 21st International Conference, {DLT}
2017, Li{\`{e}}ge, Belgium, August 7-11, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10396},
pages = {284--295},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62809-7\_21},
doi = {10.1007/978-3-319-62809-7\_21},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dlt/0001RS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/HanK0S17,
author = {Yo{-}Sub Han and
Sang{-}Ki Ko and
Timothy Ng and
Kai Salomaa},
editor = {Frank Drewes and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {Consensus String Problem for Multiple Regular Languages},
booktitle = {Language and Automata Theory and Applications - 11th International
Conference, {LATA} 2017, Ume{\aa}, Sweden, March 6-9, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10168},
pages = {196--207},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53733-7\_14},
doi = {10.1007/978-3-319-53733-7\_14},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lata/HanK0S17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChoH0S17,
author = {Da{-}Jung Cho and
Yo{-}Sub Han and
Timothy Ng and
Kai Salomaa},
title = {Outfix-guided insertion},
journal = {CoRR},
volume = {abs/1707.04651},
year = {2017},
url = {http://arxiv.org/abs/1707.04651},
eprinttype = {arXiv},
eprint = {1707.04651},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChoH0S17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/HanKNS16,
author = {Yo{-}Sub Han and
Sang{-}Ki Ko and
Timothy Ng and
Kai Salomaa},
title = {State Complexity of Insertion},
journal = {Int. J. Found. Comput. Sci.},
volume = {27},
number = {7},
pages = {863--878},
year = {2016},
url = {https://doi.org/10.1142/S0129054116500349},
doi = {10.1142/S0129054116500349},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/HanKNS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/0001RS16,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
editor = {Cezar C{\^{a}}mpeanu and
Florin Manea and
Jeffrey O. Shallit},
title = {State Complexity of Prefix Distance of Subregular Languages},
booktitle = {Descriptional Complexity of Formal Systems - 18th {IFIP} {WG} 1.2
International Conference, {DCFS} 2016, Bucharest, Romania, July 5-8,
2016. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9777},
pages = {192--204},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-41114-9\_15},
doi = {10.1007/978-3-319-41114-9\_15},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcfs/0001RS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/ChoH0S16,
author = {Da{-}Jung Cho and
Yo{-}Sub Han and
Timothy Ng and
Kai Salomaa},
editor = {Srecko Brlek and
Christophe Reutenauer},
title = {Outfix-Guided Insertion - (Extended Abstract)},
booktitle = {Developments in Language Theory - 20th International Conference, {DLT}
2016, Montr{\'{e}}al, Canada, July 25-28, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9840},
pages = {102--113},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53132-7\_9},
doi = {10.1007/978-3-662-53132-7\_9},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dlt/ChoH0S16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/ChoH0S16,
author = {Da{-}Jung Cho and
Yo{-}Sub Han and
Timothy Ng and
Kai Salomaa},
editor = {Rusins Martins Freivalds and
Gregor Engels and
Barbara Catania},
title = {Pseudoknot-Generating Operation},
booktitle = {{SOFSEM} 2016: Theory and Practice of Computer Science - 42nd International
Conference on Current Trends in Theory and Practice of Computer Science,
Harrachov, Czech Republic, January 23-28, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9587},
pages = {241--252},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49192-8\_20},
doi = {10.1007/978-3-662-49192-8\_20},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/ChoH0S16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/Ng16,
author = {Timothy Ng},
editor = {Yo{-}Sub Han and
Kai Salomaa},
title = {Prefix Distance Between Regular Languages},
booktitle = {Implementation and Application of Automata - 21st International Conference,
{CIAA} 2016, Seoul, South Korea, July 19-22, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9705},
pages = {224--235},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-40946-7\_19},
doi = {10.1007/978-3-319-40946-7\_19},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wia/Ng16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/NgRS15,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
editor = {Jeffrey O. Shallit and
Alexander Okhotin},
title = {Quasi-Distances and Weighted Finite Automata},
booktitle = {Descriptional Complexity of Formal Systems - 17th International Workshop,
{DCFS} 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9118},
pages = {209--219},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-19225-3\_18},
doi = {10.1007/978-3-319-19225-3\_18},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dcfs/NgRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/NgRS15,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
editor = {Igor Potapov},
title = {State Complexity of Neighbourhoods and Approximate Pattern Matching},
booktitle = {Developments in Language Theory - 19th International Conference, {DLT}
2015, Liverpool, UK, July 27-30, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9168},
pages = {389--400},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21500-6\_31},
doi = {10.1007/978-3-319-21500-6\_31},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dlt/NgRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/NgRS15,
author = {Timothy Ng and
David Rappaport and
Kai Salomaa},
editor = {Frank Drewes},
title = {State Complexity of Prefix Distance},
booktitle = {Implementation and Application of Automata - 20th International Conference,
{CIAA} 2015, Ume{\aa}, Sweden, August 18-21, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9223},
pages = {238--249},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-22360-5\_20},
doi = {10.1007/978-3-319-22360-5\_20},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wia/NgRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 18:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
