default search action
Search dblp for Publications
export results for "complete distance"
@article{DBLP:journals/dam/GeLZ24, author = {Jun Ge and Yucui Liao and Bohan Zhang}, title = {Resistance distances and the Moon-type formula of a vertex-weighted complete split graph}, journal = {Discret. Appl. Math.}, volume = {359}, pages = {10--15}, year = {2024}, url = {https://doi.org/10.1016/j.dam.2024.07.040}, doi = {10.1016/J.DAM.2024.07.040}, timestamp = {Sun, 08 Sep 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/GeLZ24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmaa/Banerjee24, author = {Subarsha Banerjee}, title = {Distance energy change of complete split graph due to edge deletion}, journal = {Discret. Math. Algorithms Appl.}, volume = {16}, number = {3}, pages = {2350033:1--2350033:11}, year = {2024}, url = {https://doi.org/10.1142/S1793830923500337}, doi = {10.1142/S1793830923500337}, timestamp = {Fri, 22 Mar 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dmaa/Banerjee24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/informaticaLT/WangXPLF24, author = {Haolun Wang and Tingjun Xu and Dragan Pamucar and Xuxiang Li and Liangqing Feng}, title = {A Lance Distance-Based {MAIRCA} Method for \emph{q}-Rung Orthopair Fuzzy {MCDM} with Completely Unknown Weight Information}, journal = {Informatica}, volume = {35}, number = {1}, pages = {179--202}, year = {2024}, url = {https://doi.org/10.15388/23-INFOR516}, doi = {10.15388/23-INFOR516}, timestamp = {Sat, 04 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/informaticaLT/WangXPLF24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/Rozowski24, author = {Wojciech Rozowski}, editor = {Karl Bringmann and Martin Grohe and Gabriele Puppis and Ola Svensson}, title = {A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions}, booktitle = {51st International Colloquium on Automata, Languages, and Programming, {ICALP} 2024, July 8-12, 2024, Tallinn, Estonia}, series = {LIPIcs}, volume = {297}, pages = {149:1--149:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2024}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2024.149}, doi = {10.4230/LIPICS.ICALP.2024.149}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/Rozowski24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2404-13352, author = {Wojciech Rozowski}, title = {A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions}, journal = {CoRR}, volume = {abs/2404.13352}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2404.13352}, doi = {10.48550/ARXIV.2404.13352}, eprinttype = {arXiv}, eprint = {2404.13352}, timestamp = {Fri, 31 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2404-13352.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2405-08255, author = {Arnab Bhattacharyya and Sutanu Gayen and Kuldeep S. Meel and Dimitrios Myrisiotis and A. Pavan and N. V. Vinodchandran}, title = {Total Variation Distance for Product Distributions is {\#}P-Complete}, journal = {CoRR}, volume = {abs/2405.08255}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2405.08255}, doi = {10.48550/ARXIV.2405.08255}, eprinttype = {arXiv}, eprint = {2405.08255}, timestamp = {Sat, 15 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2405-08255.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2406-14729, author = {David L. Fairbairn and George B. Mertzios and Norbert Peyerimhoff}, title = {NP-Completeness of the Combinatorial Distance Matrix Realisation Problem}, journal = {CoRR}, volume = {abs/2406.14729}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2406.14729}, doi = {10.48550/ARXIV.2406.14729}, eprinttype = {arXiv}, eprint = {2406.14729}, timestamp = {Tue, 16 Jul 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2406-14729.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/RakshithD23, author = {B. R. Rakshith and Kinkar Chandra Das}, title = {On distance Laplacian spectral determination of complete multipartite graphs}, journal = {Appl. Math. Comput.}, volume = {443}, pages = {127787}, year = {2023}, url = {https://doi.org/10.1016/j.amc.2022.127787}, doi = {10.1016/J.AMC.2022.127787}, timestamp = {Tue, 31 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/amc/RakshithD23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/axioms/Romaguera23, author = {Salvador Romaguera}, title = {An Application of wt-Distances to Characterize Complete b-Metric Spaces}, journal = {Axioms}, volume = {12}, number = {2}, pages = {121}, year = {2023}, url = {https://doi.org/10.3390/axioms12020121}, doi = {10.3390/AXIOMS12020121}, timestamp = {Sat, 11 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/axioms/Romaguera23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eswa/JinGY23, author = {Jiulin Jin and Harish Garg and Taijie You}, title = {Generalized picture fuzzy distance and similarity measures on the complete lattice and their applications}, journal = {Expert Syst. Appl.}, volume = {220}, pages = {119710}, year = {2023}, url = {https://doi.org/10.1016/j.eswa.2023.119710}, doi = {10.1016/J.ESWA.2023.119710}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eswa/JinGY23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cc/Sugita0SIS23, author = {Shu Sugita and Toru Koizumi and Ryota Shioya and Hidetsugu Irie and Shuichi Sakai}, editor = {Clark Verbrugge and Ondrej Lhot{\'{a}}k and Xipeng Shen}, title = {A Sound and Complete Algorithm for Code Generation in Distance-Based {ISA}}, booktitle = {Proceedings of the 32nd {ACM} {SIGPLAN} International Conference on Compiler Construction, {CC} 2023, Montr{\'{e}}al, QC, Canada, February 25-26, 2023}, pages = {73--84}, publisher = {{ACM}}, year = {2023}, url = {https://doi.org/10.1145/3578360.3580263}, doi = {10.1145/3578360.3580263}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cc/Sugita0SIS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/WangM22, author = {Zhiwen Wang and Xianhao Meng}, title = {Effects on distance energy of complete bipartite graphs by embedding edges}, journal = {Appl. Math. Comput.}, volume = {430}, pages = {127275}, year = {2022}, url = {https://doi.org/10.1016/j.amc.2022.127275}, doi = {10.1016/J.AMC.2022.127275}, timestamp = {Mon, 25 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amc/WangM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcmse/PuLL22, author = {Jia Pu and Yiran Liu and Hongxing Li}, title = {Organizational quality specific immune evaluation of manufacturing enterprises: Multi-attribute group decision-making method with complete ignorance of weight information based on evidence distance an..}, journal = {J. Comput. Methods Sci. Eng.}, volume = {22}, number = {4}, pages = {1287--1296}, year = {2022}, url = {https://doi.org/10.3233/JCM226048}, doi = {10.3233/JCM226048}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcmse/PuLL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jifs/OhK22, author = {Ju{-}Mok Oh and Yong Chan Kim}, title = {Topological structures and distance functions in complete co-residuated lattices}, journal = {J. Intell. Fuzzy Syst.}, volume = {43}, number = {1}, pages = {49--65}, year = {2022}, url = {https://doi.org/10.3233/JIFS-210973}, doi = {10.3233/JIFS-210973}, timestamp = {Tue, 05 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jifs/OhK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/DeCorteFV22, author = {Evan DeCorte and Fernando M{\'{a}}rio de Oliveira Filho and Frank Vallentin}, title = {Complete positivity and distance-avoiding sets}, journal = {Math. Program.}, volume = {191}, number = {2}, pages = {487--558}, year = {2022}, url = {https://doi.org/10.1007/s10107-020-01562-6}, doi = {10.1007/S10107-020-01562-6}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mp/DeCorteFV22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2208-14922, author = {Victor H. Lutfalla}, title = {Geometrical tilings : distance, topology, compacity and completeness}, journal = {CoRR}, volume = {abs/2208.14922}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2208.14922}, doi = {10.48550/ARXIV.2208.14922}, eprinttype = {arXiv}, eprint = {2208.14922}, timestamp = {Thu, 01 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2208-14922.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2210-05238, author = {Yang Liu and Ruihu Li and Qiang Fu and Hao Song}, title = {Minimum distances of binary optimal {LCD} codes of dimension five are completely determined}, journal = {CoRR}, volume = {abs/2210.05238}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2210.05238}, doi = {10.48550/ARXIV.2210.05238}, eprinttype = {arXiv}, eprint = {2210.05238}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2210-05238.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amc/ChenY21a, author = {Wuxian Chen and Weigen Yan}, title = {Resistance distances in vertex-weighted complete multipartite graphs}, journal = {Appl. Math. Comput.}, volume = {409}, pages = {126382}, year = {2021}, url = {https://doi.org/10.1016/j.amc.2021.126382}, doi = {10.1016/J.AMC.2021.126382}, timestamp = {Wed, 21 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amc/ChenY21a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijopcd/Nene21, author = {Jabulani Owen Nene}, title = {Exploring Student Support in a Completely Online Module Within an Open Distance eLearning Institution}, journal = {Int. J. Online Pedagog. Course Des.}, volume = {11}, number = {4}, pages = {33--44}, year = {2021}, url = {https://doi.org/10.4018/IJOPCD.2021100103}, doi = {10.4018/IJOPCD.2021100103}, timestamp = {Wed, 18 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijopcd/Nene21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/access/ParkS20, author = {Eunpil Park and Jae{-}Young Sim}, title = {Underwater Image Restoration Using Geodesic Color Distance and Complete Image Formation Model}, journal = {{IEEE} Access}, volume = {8}, pages = {157918--157930}, year = {2020}, url = {https://doi.org/10.1109/ACCESS.2020.3019767}, doi = {10.1109/ACCESS.2020.3019767}, timestamp = {Tue, 16 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/access/ParkS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/complexity/ZhaoLZ20, author = {Jing Zhao and Jia{-}Bao Liu and Ali Zafari}, title = {Complete Characterization of Resistance Distance for Linear Octagonal Networks}, journal = {Complex.}, volume = {2020}, pages = {5917098:1--5917098:13}, year = {2020}, url = {https://doi.org/10.1155/2020/5917098}, doi = {10.1155/2020/5917098}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/complexity/ZhaoLZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GeD20, author = {Jun Ge and Fengming Dong}, title = {Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs}, journal = {Discret. Appl. Math.}, volume = {283}, pages = {542--554}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2020.02.002}, doi = {10.1016/J.DAM.2020.02.002}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/GeD20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmaa/MasreFV20, author = {Mesfin Masre and Samuel Asefa Fufa and Tom{\'{a}}s Vetr{\'{\i}}k}, title = {Distance-based indices of complete m-ary trees}, journal = {Discret. Math. Algorithms Appl.}, volume = {12}, number = {4}, pages = {2050041:1--2050041:22}, year = {2020}, url = {https://doi.org/10.1142/S179383092050041X}, doi = {10.1142/S179383092050041X}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmaa/MasreFV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ijcaet/GuptaSV20, author = {Vishal Gupta and R. K. Saini and Manu Verma}, title = {Fixed point theorem by altering distance technique in complete fuzzy metric spaces}, journal = {Int. J. Comput. Aided Eng. Technol.}, volume = {13}, number = {4}, pages = {437--447}, year = {2020}, url = {https://doi.org/10.1504/IJCAET.2020.110479}, doi = {10.1504/IJCAET.2020.110479}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ijcaet/GuptaSV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jiat/KawaguchiYH20, author = {Taiga Kawaguchi and Takuya Yoshino and Kouichi Hirata}, title = {Path histogram distance and complete subtree histogram distance for rooted labelled caterpillars}, journal = {J. Inf. Telecommun.}, volume = {4}, number = {2}, pages = {199--212}, year = {2020}, url = {https://doi.org/10.1080/24751839.2020.1718443}, doi = {10.1080/24751839.2020.1718443}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jiat/KawaguchiYH20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/Fang0XF20, author = {Weijun Fang and Bin Chen and Shu{-}Tao Xia and Fang{-}Wei Fu}, title = {Complete Characterization of Optimal LRCs with Minimum Distance 6 and Locality 2: Improved Bounds and Constructions}, booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2020, Los Angeles, CA, USA, June 21-26, 2020}, pages = {595--599}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/ISIT44484.2020.9174347}, doi = {10.1109/ISIT44484.2020.9174347}, timestamp = {Tue, 02 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isit/Fang0XF20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2012-06083, author = {Shuhei Saito and Wei Wu and Naoki Matsumoto}, title = {Rainbow Perfect and Near-Perfect Matchings in Complete Graphs with Edges Colored by Circular Distance}, journal = {CoRR}, volume = {abs/2012.06083}, year = {2020}, url = {https://arxiv.org/abs/2012.06083}, eprinttype = {arXiv}, eprint = {2012.06083}, timestamp = {Tue, 05 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2012-06083.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ppl/AroraCM19, author = {Ajay Arora and Eddie Cheng and Colton Magnant}, title = {Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles}, journal = {Parallel Process. Lett.}, volume = {29}, number = {4}, pages = {1950016:1--1950016:9}, year = {2019}, url = {https://doi.org/10.1142/S0129626419500166}, doi = {10.1142/S0129626419500166}, timestamp = {Sat, 01 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ppl/AroraCM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cpm/LabibUW19, author = {Karim Labib and Przemyslaw Uznanski and Daniel Wolleb{-}Graf}, editor = {Nadia Pisanti and Solon P. Pissis}, title = {Hamming Distance Completeness}, booktitle = {30th Annual Symposium on Combinatorial Pattern Matching, {CPM} 2019, June 18-20, 2019, Pisa, Italy}, series = {LIPIcs}, volume = {128}, pages = {14:1--14:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.CPM.2019.14}, doi = {10.4230/LIPICS.CPM.2019.14}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/cpm/LabibUW19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iccnc/IvanS19, author = {Ivan Avramovic and Richards Dana S}, title = {NP-completeness of Shortest Leaf-to-Leaf Distance in a Tree}, booktitle = {International Conference on Computing, Networking and Communications, {ICNC} 2019, Honolulu, HI, USA, February 18-21, 2019}, pages = {747--752}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/ICCNC.2019.8685658}, doi = {10.1109/ICCNC.2019.8685658}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iccnc/IvanS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/lmcs/BacciBLM18, author = {Giorgio Bacci and Giovanni Bacci and Kim G. Larsen and Radu Mardare}, title = {A Complete Quantitative Deduction System for the Bisimilarity Distance on Markov Chains}, journal = {Log. Methods Comput. Sci.}, volume = {14}, number = {4}, year = {2018}, url = {https://doi.org/10.23638/LMCS-14(4:15)2018}, doi = {10.23638/LMCS-14(4:15)2018}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/lmcs/BacciBLM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ma/JinM18, author = {Ze Jin and David S. Matteson}, title = {Generalizing distance covariance to measure and test multivariate mutual dependence via complete and incomplete V-statistics}, journal = {J. Multivar. Anal.}, volume = {168}, pages = {304--322}, year = {2018}, url = {https://doi.org/10.1016/j.jmva.2018.08.006}, doi = {10.1016/J.JMVA.2018.08.006}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ma/JinM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/qip/LiangLYFL18, author = {Xiao{-}Bin Liang and Bo Li and Biao{-}Liang Ye and Shao{-}Ming Fei and Xianqing Li{-}Jost}, title = {Complete optimal convex approximations of qubit states under {\textbackslash}(B{\_}2{\textbackslash}) distance}, journal = {Quantum Inf. Process.}, volume = {17}, number = {7}, pages = {185}, year = {2018}, url = {https://doi.org/10.1007/s11128-018-1948-0}, doi = {10.1007/S11128-018-1948-0}, timestamp = {Thu, 16 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/qip/LiangLYFL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/0001LU18, author = {Daniel Graf and Karim Labib and Przemyslaw Uznanski}, editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'{a}}niel Marx and Donald Sannella}, title = {Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication}, booktitle = {45th International Colloquium on Automata, Languages, and Programming, {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic}, series = {LIPIcs}, volume = {107}, pages = {109:1--109:4}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.109}, doi = {10.4230/LIPICS.ICALP.2018.109}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/icalp/0001LU18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icpram/KawaguchiYH18, author = {Taiga Kawaguchi and Takuya Yoshino and Kouichi Hirata}, editor = {Maria De Marsico and Gabriella Sanniti di Baja and Ana L. N. Fred}, title = {Earth Mover's Distance Between Rooted Labeled Unordered Trees Formulated from Complete Subtrees}, booktitle = {Pattern Recognition Applications and Methods - 7th International Conference, {ICPRAM} 2018, Funchal, Madeira, Portugal, January 16-18, 2018, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {11351}, pages = {65--88}, publisher = {Springer}, year = {2018}, url = {https://doi.org/10.1007/978-3-030-05499-1\_4}, doi = {10.1007/978-3-030-05499-1\_4}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icpram/KawaguchiYH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:journals/entcs/Bacci0LM18, author = {Giorgio Bacci and Giovanni Bacci and Kim G. Larsen and Radu Mardare}, editor = {Sam Staton}, title = {Complete Axiomatization for the Total Variation Distance of Markov Chains}, booktitle = {Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, {MFPS} 2018, Dalhousie University, Halifax, Canada, June 6-9, 2018}, series = {Electronic Notes in Theoretical Computer Science}, volume = {341}, pages = {27--39}, publisher = {Elsevier}, year = {2018}, url = {https://doi.org/10.1016/j.entcs.2018.03.014}, doi = {10.1016/J.ENTCS.2018.03.014}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/entcs/Bacci0LM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arsmc/Donno17, author = {Alfredo Donno}, title = {Spectrum, distance spectrum, and Wiener index of wreath products of complete graphs}, journal = {Ars Math. Contemp.}, volume = {13}, number = {1}, pages = {207--225}, year = {2017}, url = {https://doi.org/10.26493/1855-3974.1117.7ba}, doi = {10.26493/1855-3974.1117.7BA}, timestamp = {Wed, 27 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arsmc/Donno17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/RifaZ17, author = {Josep Rif{\`{a}} and Victor A. Zinoviev}, title = {Completely regular codes with different parameters giving the same distance-regular coset graphs}, journal = {Discret. Math.}, volume = {340}, number = {7}, pages = {1649--1656}, year = {2017}, url = {https://doi.org/10.1016/j.disc.2017.03.001}, doi = {10.1016/J.DISC.2017.03.001}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/RifaZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Tsiovkina17, author = {Ludmila Yu. Tsiovkina}, title = {Arc-transitive antipodal distance-regular covers of complete graphs related to SU\({}_{\mbox{3}}\)(q)}, journal = {Discret. Math.}, volume = {340}, number = {2}, pages = {63--71}, year = {2017}, url = {https://doi.org/10.1016/j.disc.2016.08.001}, doi = {10.1016/J.DISC.2016.08.001}, timestamp = {Thu, 04 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/Tsiovkina17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ised/ChoudhuryS17, author = {Avishek Choudhury and Biplab K. Sikdar}, title = {{CIFR:} {A} complete in-place fault remapping strategy for {CMP} cache using dynamic reuse distance}, booktitle = {7th International Symposium on Embedded Computing and System Design, {ISED} 2017, Durgapur, India, December 18-20, 2017}, pages = {1--5}, publisher = {{IEEE}}, year = {2017}, url = {https://doi.org/10.1109/ISED.2017.8303922}, doi = {10.1109/ISED.2017.8303922}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ised/ChoudhuryS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/BacciBLM17, author = {Giorgio Bacci and Giovanni Bacci and Kim G. Larsen and Radu Mardare}, title = {A Complete Quantitative Deduction System for the Bisimilarity Distance on Markov Chains}, journal = {CoRR}, volume = {abs/1702.02528}, year = {2017}, url = {http://arxiv.org/abs/1702.02528}, eprinttype = {arXiv}, eprint = {1702.02528}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/BacciBLM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1711-03887, author = {Daniel Graf and Karim Labib and Przemyslaw Uznanski}, title = {Hamming distance completeness and sparse matrix multiplication}, journal = {CoRR}, volume = {abs/1711.03887}, year = {2017}, url = {http://arxiv.org/abs/1711.03887}, eprinttype = {arXiv}, eprint = {1711.03887}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1711-03887.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/coap/FanZ16, author = {Jinyan Fan and Anwa Zhou}, title = {Computing the distance between the linear matrix pencil and the completely positive cone}, journal = {Comput. Optim. Appl.}, volume = {64}, number = {3}, pages = {647--670}, year = {2016}, url = {https://doi.org/10.1007/s10589-016-9825-1}, doi = {10.1007/S10589-016-9825-1}, timestamp = {Tue, 14 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/coap/FanZ16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Gervacio16, author = {Severino Villanueva Gervacio}, title = {Resistance distance in complete n-partite graphs}, journal = {Discret. Appl. Math.}, volume = {203}, pages = {53--61}, year = {2016}, url = {https://doi.org/10.1016/j.dam.2015.09.017}, doi = {10.1016/J.DAM.2015.09.017}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Gervacio16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/Kotlar16, author = {Daniel Kotlar}, title = {Distance Magic Labeling in Complete 4-partite Graphs}, journal = {Graphs Comb.}, volume = {32}, number = {3}, pages = {1027--1038}, year = {2016}, url = {https://doi.org/10.1007/s00373-015-1627-1}, doi = {10.1007/S00373-015-1627-1}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/gc/Kotlar16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/concur/BacciBLM16, author = {Giorgio Bacci and Giovanni Bacci and Kim G. Larsen and Radu Mardare}, editor = {Jos{\'{e}}e Desharnais and Radha Jagadeesan}, title = {Complete Axiomatization for the Bisimilarity Distance on Markov Chains}, booktitle = {27th International Conference on Concurrency Theory, {CONCUR} 2016, August 23-26, 2016, Qu{\'{e}}bec City, Canada}, series = {LIPIcs}, volume = {59}, pages = {21:1--21:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.CONCUR.2016.21}, doi = {10.4230/LIPICS.CONCUR.2016.21}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/concur/BacciBLM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amco/BorgesRZ15, author = {Joaquim Borges and Josep Rif{\`{a}} and Victor A. Zinoviev}, title = {Families of nested completely regular codes and distance-regular graphs}, journal = {Adv. Math. Commun.}, volume = {9}, number = {2}, pages = {233--246}, year = {2015}, url = {https://doi.org/10.3934/amc.2015.9.233}, doi = {10.3934/AMC.2015.9.233}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amco/BorgesRZ15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/comgeo/LubiwP15, author = {Anna Lubiw and Vinayak Pathak}, title = {Flip distance between two triangulations of a point set is NP-complete}, journal = {Comput. Geom.}, volume = {49}, pages = {17--23}, year = {2015}, url = {https://doi.org/10.1016/j.comgeo.2014.11.001}, doi = {10.1016/J.COMGEO.2014.11.001}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/comgeo/LubiwP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcg/AichholzerMP15, author = {Oswin Aichholzer and Wolfgang Mulzer and Alexander Pilz}, title = {Flip Distance Between Triangulations of a Simple Polygon is NP-Complete}, journal = {Discret. Comput. Geom.}, volume = {54}, number = {2}, pages = {368--389}, year = {2015}, url = {https://doi.org/10.1007/s00454-015-9709-7}, doi = {10.1007/S00454-015-9709-7}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dcg/AichholzerMP15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HalaszT15, author = {Veronika Hal{\'{a}}sz and Zsolt Tuza}, title = {Distance-constrained labeling of complete trees}, journal = {Discret. Math.}, volume = {338}, number = {8}, pages = {1398--1406}, year = {2015}, url = {https://doi.org/10.1016/j.disc.2015.02.016}, doi = {10.1016/J.DISC.2015.02.016}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HalaszT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/AltendorferW15, author = {Richard Altendorfer and Sebastian J. Wirkert}, title = {A Complete Derivation Of The Association Log-Likelihood Distance For Multi-Object Tracking}, journal = {CoRR}, volume = {abs/1508.04124}, year = {2015}, url = {http://arxiv.org/abs/1508.04124}, eprinttype = {arXiv}, eprint = {1508.04124}, timestamp = {Fri, 05 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/AltendorferW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KarstOTZ14, author = {Nathaniel J. Karst and Jessica Oehrlein and Denise Sakai Troxell and Junjie Zhu}, title = {Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two}, journal = {Discret. Appl. Math.}, volume = {178}, pages = {101--108}, year = {2014}, url = {https://doi.org/10.1016/j.dam.2014.06.022}, doi = {10.1016/J.DAM.2014.06.022}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KarstOTZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcc/BorgesRZ14, author = {Joaquim Borges and Josep Rif{\`{a}} and Victor A. Zinoviev}, title = {New families of completely regular codes and their corresponding distance regular coset graphs}, journal = {Des. Codes Cryptogr.}, volume = {70}, number = {1-2}, pages = {139--148}, year = {2014}, url = {https://doi.org/10.1007/s10623-012-9713-3}, doi = {10.1007/S10623-012-9713-3}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcc/BorgesRZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BorgesRZ14, author = {Joaquim Borges and Josep Rif{\`{a}} and Victor A. Zinoviev}, title = {Families of completely transitive codes and distance transitive graphs}, journal = {Discret. Math.}, volume = {324}, pages = {68--71}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.02.008}, doi = {10.1016/J.DISC.2014.02.008}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BorgesRZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Gillespie13, author = {Neil I. Gillespie}, title = {A note on binary completely regular codes with large minimum distance}, journal = {Discret. Math.}, volume = {313}, number = {14}, pages = {1532--1534}, year = {2013}, url = {https://doi.org/10.1016/j.disc.2013.03.016}, doi = {10.1016/J.DISC.2013.03.016}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Gillespie13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/AichholzerMP13, author = {Oswin Aichholzer and Wolfgang Mulzer and Alexander Pilz}, editor = {Hans L. Bodlaender and Giuseppe F. Italiano}, title = {Flip Distance between Triangulations of a Simple Polygon is NP-Complete}, booktitle = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8125}, pages = {13--24}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-40450-4\_2}, doi = {10.1007/978-3-642-40450-4\_2}, timestamp = {Mon, 03 Jan 2022 22:19:39 +0100}, biburl = {https://dblp.org/rec/conf/esa/AichholzerMP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arscom/LuLS12, author = {Damei Lu and Wensong Lin and Zengmin Song}, title = {Distance two labelings of Cartesian products of complete graphs}, journal = {Ars Comb.}, volume = {104}, pages = {33--40}, year = {2012}, timestamp = {Fri, 08 Mar 2013 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arscom/LuLS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jam/NashineKG12, author = {Hemant Kumar Nashine and Zoran Kadelburg and Zorana Golubovic}, title = {Common Fixed Point Results Using Generalized Altering Distances on Orbitally Complete Ordered Metric Spaces}, journal = {J. Appl. Math.}, volume = {2012}, pages = {382094:1--382094:12}, year = {2012}, url = {https://doi.org/10.1155/2012/382094}, doi = {10.1155/2012/382094}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jam/NashineKG12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cccg/LubiwP12, author = {Anna Lubiw and Vinayak Pathak}, title = {Flip Distance Between Two Triangulations of a Point Set is NP-complete}, booktitle = {Proceedings of the 24th Canadian Conference on Computational Geometry, {CCCG} 2012, Charlottetown, Prince Edward Island, Canada, August 8-10, 2012}, pages = {119--124}, year = {2012}, url = {http://2012.cccg.ca/papers/paper63.pdf}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/cccg/LubiwP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1205-2425, author = {Anna Lubiw and Vinayak Pathak}, title = {Flip Distance Between Two Triangulations of a Point-Set is NP-complete}, journal = {CoRR}, volume = {abs/1205.2425}, year = {2012}, url = {http://arxiv.org/abs/1205.2425}, eprinttype = {arXiv}, eprint = {1205.2425}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1205-2425.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1206-3179, author = {Alexander Pilz}, title = {Flip Distance Between Triangulations of a Planar Point Set is NP-Complete}, journal = {CoRR}, volume = {abs/1206.3179}, year = {2012}, url = {http://arxiv.org/abs/1206.3179}, eprinttype = {arXiv}, eprint = {1206.3179}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1206-3179.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1209-0579, author = {Oswin Aichholzer and Wolfgang Mulzer and Alexander Pilz}, title = {Flip Distance Between Triangulations of a Simple Polygon is NP-Complete}, journal = {CoRR}, volume = {abs/1209.0579}, year = {2012}, url = {http://arxiv.org/abs/1209.0579}, eprinttype = {arXiv}, eprint = {1209.0579}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1209-0579.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1210-6459, author = {Neil I. Gillespie}, title = {A note on binary completely regular codes with large minimum distance}, journal = {CoRR}, volume = {abs/1210.6459}, year = {2012}, url = {http://arxiv.org/abs/1210.6459}, eprinttype = {arXiv}, eprint = {1210.6459}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1210-6459.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arscom/MiaoG11, author = {Huifang Miao and Xiaofeng Guo}, title = {Strong Distances in Strong Oriented Complete k-Partite Graphs}, journal = {Ars Comb.}, volume = {102}, pages = {213--223}, year = {2011}, timestamp = {Thu, 07 Mar 2013 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arscom/MiaoG11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arsmc/KlinP11, author = {Mikhail H. Klin and Christian Pech}, title = {A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices}, journal = {Ars Math. Contemp.}, volume = {4}, number = {2}, pages = {205--243}, year = {2011}, url = {https://doi.org/10.26493/1855-3974.191.16b}, doi = {10.26493/1855-3974.191.16B}, timestamp = {Wed, 27 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arsmc/KlinP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1111-0356, author = {Ivan Soprunov}, title = {Minimum distance for toric complete intersection codes}, journal = {CoRR}, volume = {abs/1111.0356}, year = {2011}, url = {http://arxiv.org/abs/1111.0356}, eprinttype = {arXiv}, eprint = {1111.0356}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1111-0356.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1009-4966, author = {Eliseo Sarmiento and Maria Vaz Pinto and Rafael H. Villarreal}, title = {The minimum distance of parameterized codes of complete intersection vanishing ideals over finite fields}, journal = {CoRR}, volume = {abs/1009.4966}, year = {2010}, url = {http://arxiv.org/abs/1009.4966}, eprinttype = {arXiv}, eprint = {1009.4966}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1009-4966.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/adac/GuyonBG09, author = {Fr{\'{e}}d{\'{e}}ric Guyon and C{\'{e}}line Brochier{-}Armanet and Alain Gu{\'{e}}noche}, title = {Comparison of alignment free string distances for complete genome phylogeny}, journal = {Adv. Data Anal. Classif.}, volume = {3}, number = {2}, pages = {95--108}, year = {2009}, url = {https://doi.org/10.1007/s11634-009-0041-z}, doi = {10.1007/S11634-009-0041-Z}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/adac/GuyonBG09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcc/Varandas09, author = {Ant{\'{o}}nio J. C. Varandas}, title = {M{\o}ller-Plesset perturbation energies and distances for HeC\({}_{\mbox{20}}\) extrapolated to the complete basis set limit}, journal = {J. Comput. Chem.}, volume = {30}, number = {3}, pages = {379--388}, year = {2009}, url = {https://doi.org/10.1002/jcc.21063}, doi = {10.1002/JCC.21063}, timestamp = {Wed, 01 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcc/Varandas09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BonsmaC09, author = {Paul S. Bonsma and Luis Cereceda}, title = {Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances}, journal = {Theor. Comput. Sci.}, volume = {410}, number = {50}, pages = {5215--5226}, year = {2009}, url = {https://doi.org/10.1016/j.tcs.2009.08.023}, doi = {10.1016/J.TCS.2009.08.023}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BonsmaC09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iros/ChoiLBO09, author = {Young{-}Ho Choi and Tae{-}Kyeong Lee and Sanghoon Baek and Se{-}Young Oh}, title = {Online complete coverage path planning for mobile robots based on linked spiral paths using constrained inverse distance transform}, booktitle = {2009 {IEEE/RSJ} International Conference on Intelligent Robots and Systems, October 11-15, 2009, St. Louis, MO, {USA}}, pages = {5788--5793}, publisher = {{IEEE}}, year = {2009}, url = {https://doi.org/10.1109/IROS.2009.5354499}, doi = {10.1109/IROS.2009.5354499}, timestamp = {Wed, 16 Oct 2019 14:14:51 +0200}, biburl = {https://dblp.org/rec/conf/iros/ChoiLBO09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/CheeDLL08, author = {Yeow Meng Chee and Son Hoang Dau and Alan C. H. Ling and San Ling}, title = {The Sizes of Optimal q -Ary Codes of Weight Three and Distance Four: {A} Complete Solution}, journal = {{IEEE} Trans. Inf. Theory}, volume = {54}, number = {3}, pages = {1291--1295}, year = {2008}, url = {https://doi.org/10.1109/TIT.2007.915885}, doi = {10.1109/TIT.2007.915885}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/CheeDLL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fskd/LiuWYL08, author = {Hsiang{-}Chuan Liu and Der{-}Bang Wu and Jeng{-}Ming Yih and Shin{-}Wu Liu}, editor = {Jun Ma and Yilong Yin and Jian Yu and Shuigeng Zhou}, title = {Fuzzy c-Mean Algorithm Based on Complete Mahalanobis Distances and Separable Criterion}, booktitle = {Fifth International Conference on Fuzzy Systems and Knowledge Discovery, {FSKD} 2008, 18-20 October 2008, Jinan, Shandong, China, Proceedings, Volume 1}, pages = {87--91}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FSKD.2008.34}, doi = {10.1109/FSKD.2008.34}, timestamp = {Thu, 15 Aug 2024 07:54:34 +0200}, biburl = {https://dblp.org/rec/conf/fskd/LiuWYL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iros/MohanSKSS08, author = {Mahesh Mohan and Rahul Sawhney and K. Madhava Krishna and K. Srinathan and Manohar B. Srikanth}, title = {Covering hostile terrains with partial and complete visibilities: On minimum distance paths}, booktitle = {2008 {IEEE/RSJ} International Conference on Intelligent Robots and Systems, September 22-26, 2008, Acropolis Convention Center, Nice, France}, pages = {2572--2577}, publisher = {{IEEE}}, year = {2008}, url = {https://doi.org/10.1109/IROS.2008.4651077}, doi = {10.1109/IROS.2008.4651077}, timestamp = {Wed, 16 Oct 2019 14:14:51 +0200}, biburl = {https://dblp.org/rec/conf/iros/MohanSKSS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isda/LiuWYL08, author = {Hsiang{-}Chuan Liu and Der{-}Bang Wu and Jeng{-}Ming Yih and Shin{-}Wu Liu}, editor = {Jeng{-}Shyang Pan and Ajith Abraham and Chin{-}Chen Chang}, title = {Fuzzy Possibility C-Mean Based on Complete Mahalanobis Distance and Separable Criterion}, booktitle = {Eighth International Conference on Intelligent Systems Design and Applications, {ISDA} 2008, 26-28 November 2008, Kaohsiung, Taiwan, 3 Volumes}, pages = {89--94}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/ISDA.2008.100}, doi = {10.1109/ISDA.2008.100}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/isda/LiuWYL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0803-3658, author = {Yeow Meng Chee and Son Hoang Dau and Alan C. H. Ling and San Ling}, title = {The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four: {A} Complete Solution}, journal = {CoRR}, volume = {abs/0803.3658}, year = {2008}, url = {http://arxiv.org/abs/0803.3658}, eprinttype = {arXiv}, eprint = {0803.3658}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0803-3658.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Dinh07, author = {Hai Q. Dinh}, title = {Complete Distances of All Negacyclic Codes of Length 2\({}^{\mbox{s}}\) Over BBZ\({}_{\mbox{2\({}^{\mbox{a}}\)}}\)}, journal = {{IEEE} Trans. Inf. Theory}, volume = {53}, number = {1}, pages = {147--161}, year = {2007}, url = {https://doi.org/10.1109/TIT.2006.887487}, doi = {10.1109/TIT.2006.887487}, timestamp = {Wed, 04 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/Dinh07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icnc/YuMZA07, author = {Zu{-}Guo Yu and Zhi Mao and Li{-}Qian Zhou and Vo V. Anh}, editor = {Jingsheng Lei and JingTao Yao and Qingfu Zhang}, title = {A Mutual Information Based Sequence Distance For Vertebrate Phylogeny Using Complete Mitochondrial Genomes}, booktitle = {Third International Conference on Natural Computation, {ICNC} 2007, Haikou, Hainan, China, 24-27 August 2007, Volume 2}, pages = {253--257}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/ICNC.2007.78}, doi = {10.1109/ICNC.2007.78}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icnc/YuMZA07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icnc/ZhouYNLAC07, author = {Li{-}Qian Zhou and Zu{-}Guo Yu and Pan{-}Ren Nie and Fang{-}Fang Liao and Vo V. Anh and Yang{-}Jun Chen}, editor = {Jingsheng Lei and JingTao Yao and Qingfu Zhang}, title = {Log-correlation Distance And Fourier Transform With Kullback-Leibler Divergence Distance For Construction Of Vertebrate Phylogeny Using Complete Mitochondrial Genomes}, booktitle = {Third International Conference on Natural Computation, {ICNC} 2007, Haikou, Hainan, China, 24-27 August 2007, Volume 2}, pages = {304--308}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/ICNC.2007.462}, doi = {10.1109/ICNC.2007.462}, timestamp = {Wed, 10 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icnc/ZhouYNLAC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BonsmaC07, author = {Paul S. Bonsma and Luis Cereceda}, editor = {Ludek Kucera and Anton{\'{\i}}n Kucera}, title = {Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances}, booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic, August 26-31, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4708}, pages = {738--749}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74456-6\_65}, doi = {10.1007/978-3-540-74456-6\_65}, timestamp = {Fri, 30 Aug 2019 10:02:28 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/BonsmaC07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcc/HommaK06a, author = {Masaaki Homma and Seon Jeong Kim}, title = {The Complete Determination of the Minimum Distance of Two-Point Codes on a Hermitian Curve}, journal = {Des. Codes Cryptogr.}, volume = {40}, number = {1}, pages = {5--24}, year = {2006}, url = {https://doi.org/10.1007/s10623-005-4599-y}, doi = {10.1007/S10623-005-4599-Y}, timestamp = {Mon, 17 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcc/HommaK06a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Korzhik06, author = {Vladimir P. Korzhik}, title = {On the maximal distance between triangular embeddings of a complete graph}, journal = {J. Comb. Theory {B}}, volume = {96}, number = {3}, pages = {426--435}, year = {2006}, url = {https://doi.org/10.1016/j.jctb.2005.09.006}, doi = {10.1016/J.JCTB.2005.09.006}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Korzhik06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wafr/PotluriYCDB06, author = {Shobha Potluri and Anthony K. Yan and James J. Chou and Bruce Randall Donald and Chris Bailey{-}Kellogg}, editor = {Srinivas Akella and Nancy M. Amato and Wesley H. Huang and Bud Mishra}, title = {Extended Abstract: Structure Determination of Symmetric Protein Complexes by a Complete Search of Symmetry Configuration Space Using {NMR} Distance Restraints}, booktitle = {Algorithmic Foundation of Robotics VII, Selected Contributions of the Seventh International Workshop on the Algorithmic Foundations of Robotics, {WAFR} 2006, July 16-18, 2006, New York, NY, {USA}}, series = {Springer Tracts in Advanced Robotics}, volume = {47}, pages = {335--340}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/978-3-540-68405-3\_21}, doi = {10.1007/978-3-540-68405-3\_21}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wafr/PotluriYCDB06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dcc/CaenF05, author = {Dominique de Caen and Dmitry Fon{-}Der{-}Flaass}, title = {Distance Regular Covers of Complete Graphs from Latin Squares}, journal = {Des. Codes Cryptogr.}, volume = {34}, number = {2-3}, pages = {149--153}, year = {2005}, url = {https://doi.org/10.1007/s10623-004-4851-x}, doi = {10.1007/S10623-004-4851-X}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dcc/CaenF05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-cs-0509100, author = {Jeff Erickson and Shripad Thite and David P. Bunde}, title = {Distance-2 Edge Coloring is NP-Complete}, journal = {CoRR}, volume = {abs/cs/0509100}, year = {2005}, url = {http://arxiv.org/abs/cs/0509100}, eprinttype = {arXiv}, eprint = {cs/0509100}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-cs-0509100.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iahe/Kramer04, author = {Heidi Kramer}, title = {Distance Education: The Complete Guide to Design, Delivery, and Improvement: Johnson, J. L. {(2003).} New York: Teachers College Press, 230 pages, {ISBN:} 0-8077-4373-0 (paper). US{\textdollar}32.95}, journal = {Internet High. Educ.}, volume = {7}, number = {1}, pages = {71--74}, year = {2004}, url = {https://doi.org/10.1016/j.iheduc.2003.11.002}, doi = {10.1016/J.IHEDUC.2003.11.002}, timestamp = {Wed, 16 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/iahe/Kramer04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/nca/KamenopoulosOT04, author = {Dimitris Kamenopoulos and Iosif A. Osman and Panayotis Tsanakas}, title = {Distance Measurement in Volunteer Computing Networks: {A} Completely Decentralized Approach}, booktitle = {3rd {IEEE} International Symposium on Network Computing and Applications {(NCA} 2004), 30 August - 1 September 2004, Cambridge, MA, {USA}}, pages = {399--404}, publisher = {{IEEE} Computer Society}, year = {2004}, url = {https://doi.org/10.1109/NCA.2004.1347808}, doi = {10.1109/NCA.2004.1347808}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/nca/KamenopoulosOT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/GrannellGKS03, author = {Mike J. Grannell and Terry S. Griggs and Vladimir P. Korzhik and Jozef Sir{\'{a}}n}, title = {On the minimal nonzero distance between triangular embeddings of a complete graph}, journal = {Discret. Math.}, volume = {269}, number = {1-3}, pages = {149--160}, year = {2003}, url = {https://doi.org/10.1016/S0012-365X(02)00751-3}, doi = {10.1016/S0012-365X(02)00751-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/GrannellGKS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/FiolG01, author = {Miguel Angel Fiol and Ernest Garriga}, title = {An Algebraic Characterization of Completely Regular Codes in Distance-Regular Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {15}, number = {1}, pages = {1--13}, year = {2001}, url = {https://doi.org/10.1137/S0895480100376496}, doi = {10.1137/S0895480100376496}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/FiolG01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/GeorgesMS01, author = {John P. Georges and David W. Mauro and Melanie I. Stein}, title = {Labeling Products of Complete Graphs with a Condition at Distance Two}, journal = {{SIAM} J. Discret. Math.}, volume = {14}, number = {1}, pages = {28--35}, year = {2001}, url = {https://doi.org/10.1137/S0895480199351859}, doi = {10.1137/S0895480199351859}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/GeorgesMS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/visualization/HuangCLL01, author = {Jian Huang and Yan Li and Roger Crawfis and Shao{-}Chiung Lu and Shuh{-}Yuan Liou}, editor = {Thomas Ertl and Kenneth I. Joy and Amitabh Varshney}, title = {A Complete Distance Field Representation}, booktitle = {12th {IEEE} Visualization Conference, {IEEE} Vis 2001, San Diego, CA, USA, October 24-26, 2001, Proceedings}, pages = {247--254}, publisher = {{IEEE} Computer Society}, year = {2001}, url = {https://doi.org/10.1109/VISUAL.2001.964518}, doi = {10.1109/VISUAL.2001.964518}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/visualization/HuangCLL01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ecis/Kurbel00, author = {Karl Kurbel}, editor = {Hans Robert Hansen and Martin Bichler and Harald Mahrer}, title = {A Completely Virtual Distance Education Program Based on the Internet - Case and Agenda of the International {MBI} Program}, booktitle = {Proceedings of the 8th European Conference on Information Systems, Trends in Information and Communication Systems for the 21st Century, {ECIS} 2000, Vienna, Austria, July 3-5, 2000}, pages = {1363--1367}, year = {2000}, url = {http://aisel.aisnet.org/ecis2000/140}, timestamp = {Mon, 05 Dec 2016 15:14:00 +0100}, biburl = {https://dblp.org/rec/conf/ecis/Kurbel00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icmcs/Duran-de-JesusVI00, author = {Javier Dur{\'{a}}n{-}de{-}Jesus and Juan Jos{\'{e}} Villacorta{-}Calvo and Alberto Izquierdo{-}Fuente}, title = {Complete System for Distance Learning over {IP}}, booktitle = {2000 {IEEE} International Conference on Multimedia and Expo, {ICME} 2000, New York, NY, USA, July 30 - August 2, 2000}, pages = {27--30}, publisher = {{IEEE} Computer Society}, year = {2000}, url = {https://doi.org/10.1109/ICME.2000.869538}, doi = {10.1109/ICME.2000.869538}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icmcs/Duran-de-JesusVI00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/GodsilLP98, author = {Chris D. Godsil and Robert A. Liebler and Cheryl E. Praeger}, title = {Antipodal Distance Transitive Covers of Complete Graphs}, journal = {Eur. J. Comb.}, volume = {19}, number = {4}, pages = {455--478}, year = {1998}, url = {https://doi.org/10.1006/eujc.1997.0190}, doi = {10.1006/EUJC.1997.0190}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/GodsilLP98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/IvanovLPP97, author = {Alexandre A. Ivanov and Robert A. Liebler and Tim Penttila and Cheryl E. Praeger}, title = {Antipodal Distance-transitive Covers of Complete Bipartite Graphs}, journal = {Eur. J. Comb.}, volume = {18}, number = {1}, pages = {11--33}, year = {1997}, url = {https://doi.org/10.1006/eujc.1993.0086}, doi = {10.1006/EUJC.1993.0086}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/IvanovLPP97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icpr/MokademDG96, author = {A. Mokadem and Mohamed Daoudi and Faouzi Ghorbel}, title = {A shape distance by complete and stable invariant descriptors for contour tracking}, booktitle = {13th International Conference on Pattern Recognition, {ICPR} 1996, Vienna, Austria, 25-19 August, 1996}, pages = {105--109}, publisher = {{IEEE} Computer Society}, year = {1996}, url = {https://doi.org/10.1109/ICPR.1996.546000}, doi = {10.1109/ICPR.1996.546000}, timestamp = {Sun, 04 Aug 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icpr/MokademDG96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/pc/ChenC95, author = {Ling Chen and Henry Y. H. Chuang}, title = {An Efficient Algorithm for Complete Euclidean Distance Transform on Mesh-Connected {SIMD}}, journal = {Parallel Comput.}, volume = {21}, number = {5}, pages = {841--852}, year = {1995}, url = {https://doi.org/10.1016/0167-8191(94)00103-H}, doi = {10.1016/0167-8191(94)00103-H}, timestamp = {Sat, 22 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/pc/ChenC95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/vlsisp/ChenC95, author = {Ling Chen and Henry Y. H. Chuang}, title = {Designing systolic architectures for complete Euclidean distance transform}, journal = {J. {VLSI} Signal Process.}, volume = {10}, number = {2}, pages = {169--179}, year = {1995}, url = {https://doi.org/10.1007/BF02407034}, doi = {10.1007/BF02407034}, timestamp = {Tue, 14 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/vlsisp/ChenC95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/GodsilH92, author = {Chris D. Godsil and A. D. Hensel}, title = {Distance regular covers of the complete graph}, journal = {J. Comb. Theory {B}}, volume = {56}, number = {2}, pages = {205--238}, year = {1992}, url = {https://doi.org/10.1016/0095-8956(92)90019-T}, doi = {10.1016/0095-8956(92)90019-T}, timestamp = {Fri, 07 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/GodsilH92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Dur91, author = {Arne D{\"{u}}r}, title = {Complete decoding of doubly-extended Reed-Solomon codes of minimum distance 5 and 6}, journal = {Discret. Appl. Math.}, volume = {33}, number = {1-3}, pages = {95--107}, year = {1991}, url = {https://doi.org/10.1016/0166-218X(91)90110-I}, doi = {10.1016/0166-218X(91)90110-I}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Dur91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/CourteauM91, author = {Bernard Courteau and Andr{\'{e}} Montpetit}, title = {Dual distances of completely regular codes}, journal = {Discret. Math.}, volume = {89}, number = {1}, pages = {7--15}, year = {1991}, url = {https://doi.org/10.1016/0012-365X(91)90395-I}, doi = {10.1016/0012-365X(91)90395-I}, timestamp = {Fri, 15 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/CourteauM91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaecc/RifaP91, author = {Josep Rif{\`{a}} and Jaume Pujol}, editor = {Harold F. Mattson and Teo Mora and T. R. N. Rao}, title = {Completely Transitive Codes and Distance Transitive Graphs}, booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 9th International Symposium, AAECC-9, New Orleans, LA, USA, October 7-11, 1991, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {539}, pages = {360--367}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-54522-0\_124}, doi = {10.1007/3-540-54522-0\_124}, timestamp = {Fri, 17 Jul 2020 16:12:48 +0200}, biburl = {https://dblp.org/rec/conf/aaecc/RifaP91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/RifaH90, author = {Josep Rif{\`{a}} and Ll. Huguet}, title = {Classification of a class of distance-regular graphs via completely regular codes}, journal = {Discret. Appl. Math.}, volume = {26}, number = {2-3}, pages = {289--300}, year = {1990}, url = {https://doi.org/10.1016/0166-218X(90)90106-M}, doi = {10.1016/0166-218X(90)90106-M}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/RifaH90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaecc/Rifa-Coma90, author = {Josep Rif{\`{a}}{-}Coma}, editor = {Shojiro Sakata}, title = {On a Categorial Isomorphism between a Class of Completely Regular Codes and a Class of Distance Regular Graphs}, booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 8th International Symposium, AAECC-8, Tokyo, Japan, August 20-24, 1990, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {508}, pages = {164--179}, publisher = {Springer}, year = {1990}, url = {https://doi.org/10.1007/3-540-54195-0\_49}, doi = {10.1007/3-540-54195-0\_49}, timestamp = {Fri, 17 Jul 2020 16:12:48 +0200}, biburl = {https://dblp.org/rec/conf/aaecc/Rifa-Coma90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaecc/Rifa-Coma87, author = {Josep Rif{\`{a}}{-}Coma}, editor = {Lloren{\c{c}} Huguet i Rotger and Alain Poli}, title = {On the Construction of Completely Regular Linear Codes from Distance-Regular Graphs}, booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 5th International Conference, AAECC-5, Menorca, Spain, June 15-19, 1987, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {356}, pages = {376--393}, publisher = {Springer}, year = {1987}, url = {https://doi.org/10.1007/3-540-51082-6\_94}, doi = {10.1007/3-540-51082-6\_94}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/aaecc/Rifa-Coma87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/Yen72, author = {Jin Y. Yen}, title = {Finding the Lengths of All Shortest paths in N-Node Nonnegative-Distance Complete Networks Using {\textonehalf}N{\({^3}\)} Additions and N{\({^3}\)} Comparisons}, journal = {J. {ACM}}, volume = {19}, number = {3}, pages = {423--424}, year = {1972}, url = {https://doi.org/10.1145/321707.321712}, doi = {10.1145/321707.321712}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/Yen72.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.