Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/ipl/ipl80.bht:"
@article{DBLP:journals/ipl/AcetoF01, author = {Luca Aceto and Wan J. Fokkink}, title = {Preface: Process Algebra}, journal = {Inf. Process. Lett.}, volume = {80}, number = {1}, pages = {1}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00211-3}, doi = {10.1016/S0020-0190(01)00211-3}, timestamp = {Mon, 18 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/AcetoF01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BaldoniHMR01, author = {Roberto Baldoni and Jean{-}Michel H{\'{e}}lary and Achour Most{\'{e}}faoui and Michel Raynal}, title = {Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the {RDT} property}, journal = {Inf. Process. Lett.}, volume = {80}, number = {2}, pages = {105--111}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00145-4}, doi = {10.1016/S0020-0190(01)00145-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BaldoniHMR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Baruah01, author = {Sanjoy K. Baruah}, title = {Scheduling periodic tasks on uniform multiprocessors}, journal = {Inf. Process. Lett.}, volume = {80}, number = {2}, pages = {97--104}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00148-X}, doi = {10.1016/S0020-0190(01)00148-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Baruah01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BergstraP01, author = {Jan A. Bergstra and Alban Ponse}, title = {Process algebra and conditional composition}, journal = {Inf. Process. Lett.}, volume = {80}, number = {1}, pages = {41--49}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00216-2}, doi = {10.1016/S0020-0190(01)00216-2}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BergstraP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BertschN01, author = {Eberhard Bertsch and Mark{-}Jan Nederhof}, title = {Size/lookahead tradeoff for LL(k)-grammars}, journal = {Inf. Process. Lett.}, volume = {80}, number = {3}, pages = {125--129}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00156-9}, doi = {10.1016/S0020-0190(01)00156-9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BertschN01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BiazW01, author = {Saad Biaz and Jennifer L. Welch}, title = {Closed form bounds for clock synchronization under simple uncertainty assumptions}, journal = {Inf. Process. Lett.}, volume = {80}, number = {3}, pages = {151--157}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00151-X}, doi = {10.1016/S0020-0190(01)00151-X}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BiazW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/BoxerM01, author = {Laurence Boxer and Russ Miller}, title = {A parallel algorithm for approximate regularity}, journal = {Inf. Process. Lett.}, volume = {80}, number = {6}, pages = {311--316}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00252-6}, doi = {10.1016/S0020-0190(01)00252-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/BoxerM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CalvoKMST01, author = {Jorge Alberto Calvo and Danny Krizanc and Pat Morin and Michael A. Soss and Godfried T. Toussaint}, title = {Convexifying polygons with simple projections}, journal = {Inf. Process. Lett.}, volume = {80}, number = {2}, pages = {81--86}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00150-8}, doi = {10.1016/S0020-0190(01)00150-8}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/CalvoKMST01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CazorlaCRP01, author = {Diego Cazorla and Fernando Cuartero and Valent{\'{\i}}n Valero Ruiz and Fernando L. Pelayo}, title = {A process algebra for probabilistic and nondeterministic processes}, journal = {Inf. Process. Lett.}, volume = {80}, number = {1}, pages = {15--23}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00213-7}, doi = {10.1016/S0020-0190(01)00213-7}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CazorlaCRP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChangC01, author = {Ye{-}In Chang and Bor{-}Hsu Chen}, title = {A generalized grid quorum strategy for k-mutual exclusion in distributed systems}, journal = {Inf. Process. Lett.}, volume = {80}, number = {4}, pages = {205--212}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00164-8}, doi = {10.1016/S0020-0190(01)00164-8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChangC01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ChienWJT01, author = {Hung{-}Yu Chien and Tzong{-}Chen Wu and Jinn{-}ke Jan and Yuh{-}Min Tseng}, title = {Cryptanalysis of Chang-Wu's group-oriented authentication and key exchange protocols}, journal = {Inf. Process. Lett.}, volume = {80}, number = {2}, pages = {113--117}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00147-8}, doi = {10.1016/S0020-0190(01)00147-8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ChienWJT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CostagliolaDFG01, author = {Gennaro Costagliola and Vincenzo Deufemia and Filomena Ferrucci and Carmine Gravino}, title = {Decidability of the consistency problem for regular symbolic picture description languages}, journal = {Inf. Process. Lett.}, volume = {80}, number = {3}, pages = {119--124}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00154-5}, doi = {10.1016/S0020-0190(01)00154-5}, timestamp = {Thu, 23 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CostagliolaDFG01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CrochemoreIPR01, author = {Maxime Crochemore and Costas S. Iliopoulos and Yoan J. Pinz{\'{o}}n and James F. Reid}, title = {A fast and practical bit-vector algorithm for the Longest Common Subsequence problem}, journal = {Inf. Process. Lett.}, volume = {80}, number = {6}, pages = {279--285}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00182-X}, doi = {10.1016/S0020-0190(01)00182-X}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CrochemoreIPR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Golic01, author = {Jovan Dj. Golic}, title = {A probabilistic cryptanalytic method for a time-variant permutation generator}, journal = {Inf. Process. Lett.}, volume = {80}, number = {2}, pages = {67--73}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00146-6}, doi = {10.1016/S0020-0190(01)00146-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Golic01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GreenP01, author = {Frederic Green and Randall Pruim}, title = {Relativized separation of {EQP} from P\({}^{\mbox{NP}}\)}, journal = {Inf. Process. Lett.}, volume = {80}, number = {5}, pages = {257--260}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00176-4}, doi = {10.1016/S0020-0190(01)00176-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GreenP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/GuanYY01, author = {Xudong Guan and Yiling Yang and Jinyuan You}, title = {Typing evolving ambients}, journal = {Inf. Process. Lett.}, volume = {80}, number = {5}, pages = {265--270}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00172-7}, doi = {10.1016/S0020-0190(01)00172-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/GuanYY01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HassinR01, author = {Refael Hassin and Shlomi Rubinstein}, title = {Approximation algorithms for maximum linear arrangement}, journal = {Inf. Process. Lett.}, volume = {80}, number = {4}, pages = {171--177}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00159-4}, doi = {10.1016/S0020-0190(01)00159-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HassinR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HedetniemiJS01, author = {Stephen T. Hedetniemi and David Pokrass Jacobs and Pradip K. Srimani}, title = {Maximal matching stabilizes in time O(m)}, journal = {Inf. Process. Lett.}, volume = {80}, number = {5}, pages = {221--223}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00171-5}, doi = {10.1016/S0020-0190(01)00171-5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HedetniemiJS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/HuangC01, author = {Shing{-}Tsaan Huang and Bau{-}Wen Chen}, title = {Optimal 1-fair alternators}, journal = {Inf. Process. Lett.}, volume = {80}, number = {3}, pages = {159--163}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00158-2}, doi = {10.1016/S0020-0190(01)00158-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/HuangC01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KadrieDTS01, author = {Ahmad Kadrie and V. Rajkumar Dare and D. Gnanaraj Thomas and K. G. Subramanian}, title = {Algebraic properties of the shuffle over omega-trajectories}, journal = {Inf. Process. Lett.}, volume = {80}, number = {3}, pages = {139--144}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00153-3}, doi = {10.1016/S0020-0190(01)00153-3}, timestamp = {Fri, 25 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/KadrieDTS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KonjevodRS01, author = {Goran Konjevod and R. Ravi and F. Sibel Salman}, title = {On approximating planar metrics by tree metrics}, journal = {Inf. Process. Lett.}, volume = {80}, number = {4}, pages = {213--219}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00161-2}, doi = {10.1016/S0020-0190(01)00161-2}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KonjevodRS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LeeC01, author = {Seok{-}Lyong Lee and Chin{-}Wan Chung}, title = {On the effective clustering of multidimensional data sequences}, journal = {Inf. Process. Lett.}, volume = {80}, number = {2}, pages = {87--95}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00144-2}, doi = {10.1016/S0020-0190(01)00144-2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LeeC01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LeeHS01, author = {Minkyu Lee and Dongsoo Han and Jaeyong Shim}, title = {Set-based access conflict analysis of concurrent workflow definition}, journal = {Inf. Process. Lett.}, volume = {80}, number = {4}, pages = {189--194}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00162-4}, doi = {10.1016/S0020-0190(01)00162-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LeeHS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LeeKP01, author = {Hanwook Lee and Dae Woong Kim and Chan{-}Ik Park}, title = {Phased {RGSS:} An improved disk array scheduling for continuous media retrieval}, journal = {Inf. Process. Lett.}, volume = {80}, number = {5}, pages = {225--231}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00178-8}, doi = {10.1016/S0020-0190(01)00178-8}, timestamp = {Sun, 22 Dec 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/LeeKP01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LiHCCTC01, author = {Z. C. Li and Lucas Chi Kwong Hui and Kam{-}Pui Chow and C. F. Chong and Wai Wan Tsang and H. W. Chan}, title = {Security of Wang et al.'s group-oriented (t, n) threshold signature schemes with traceable signers}, journal = {Inf. Process. Lett.}, volume = {80}, number = {6}, pages = {295--298}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00179-X}, doi = {10.1016/S0020-0190(01)00179-X}, timestamp = {Wed, 10 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LiHCCTC01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/LuWC01, author = {Erl{-}Huei Lu and Shao{-}Wei Wu and Yi{-}Chang Cheng}, title = {A decoding algorithm for triple-error-correcting binary {BCH} codes}, journal = {Inf. Process. Lett.}, volume = {80}, number = {6}, pages = {299--303}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00180-6}, doi = {10.1016/S0020-0190(01)00180-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/LuWC01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/MartinG01, author = {Clare E. Martin and Jeremy Gibbons}, title = {On the semantics of nested datatypes}, journal = {Inf. Process. Lett.}, volume = {80}, number = {5}, pages = {233--238}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00168-5}, doi = {10.1016/S0020-0190(01)00168-5}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/MartinG01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Monnot01, author = {J{\'{e}}r{\^{o}}me Monnot}, title = {The maximum f-depth spanning tree problem}, journal = {Inf. Process. Lett.}, volume = {80}, number = {4}, pages = {179--187}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00160-0}, doi = {10.1016/S0020-0190(01)00160-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Monnot01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/NagamochiII01, author = {Hiroshi Nagamochi and Toshimasa Ishii and Hiro Ito}, title = {Minimum cost source location problem with vertex-connectivity requirements in digraphs}, journal = {Inf. Process. Lett.}, volume = {80}, number = {6}, pages = {287--293}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00183-1}, doi = {10.1016/S0020-0190(01)00183-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/NagamochiII01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/NielsonNS01, author = {Flemming Nielson and Hanne Riis Nielson and Shmuel Sagiv}, title = {Kleene's Logic with Equality}, journal = {Inf. Process. Lett.}, volume = {80}, number = {3}, pages = {131--137}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00155-7}, doi = {10.1016/S0020-0190(01)00155-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/NielsonNS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/NomikosPZ01, author = {Christos Nomikos and Aris Pagourtzis and Stathis Zachos}, title = {Routing and path multicoloring}, journal = {Inf. Process. Lett.}, volume = {80}, number = {5}, pages = {249--256}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00167-3}, doi = {10.1016/S0020-0190(01)00167-3}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/NomikosPZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ParkHK01, author = {Dong{-}Joo Park and Shin Heu and Hyoung{-}Joo Kim}, title = {The RS-tree: An efficient data structure for distance browsing queries}, journal = {Inf. Process. Lett.}, volume = {80}, number = {4}, pages = {195--203}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00163-6}, doi = {10.1016/S0020-0190(01)00163-6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ParkHK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/PhilippouSLCS01, author = {Anna Philippou and Oleg Sokolsky and Insup Lee and Rance Cleaveland and Scott A. Smolka}, title = {Hiding resources that can fail: An axiomatic perspective}, journal = {Inf. Process. Lett.}, volume = {80}, number = {1}, pages = {3--13}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00212-5}, doi = {10.1016/S0020-0190(01)00212-5}, timestamp = {Thu, 26 Jan 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/PhilippouSLCS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/PonseU01, author = {Alban Ponse and Yaroslav S. Usenko}, title = {Equivalence of recursive specifications in process algebra}, journal = {Inf. Process. Lett.}, volume = {80}, number = {1}, pages = {59--65}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00218-6}, doi = {10.1016/S0020-0190(01)00218-6}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/PonseU01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/PriamiRSS01, author = {Corrado Priami and Aviv Regev and Ehud Shapiro and William Silverman}, title = {Application of a stochastic name-passing calculus to representation and simulation of molecular processes}, journal = {Inf. Process. Lett.}, volume = {80}, number = {1}, pages = {25--31}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00214-9}, doi = {10.1016/S0020-0190(01)00214-9}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/PriamiRSS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/RadhakrishnanR01, author = {Jaikumar Radhakrishnan and Venkatesh Raman}, title = {A tradeoff between search and update in dictionaries}, journal = {Inf. Process. Lett.}, volume = {80}, number = {5}, pages = {243--247}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00173-9}, doi = {10.1016/S0020-0190(01)00173-9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/RadhakrishnanR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Raffinot01, author = {Mathieu Raffinot}, title = {On maximal repeats in strings}, journal = {Inf. Process. Lett.}, volume = {80}, number = {3}, pages = {165--169}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00152-1}, doi = {10.1016/S0020-0190(01)00152-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Raffinot01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Sarbazi-AzadOM01, author = {Hamid Sarbazi{-}Azad and Mohamed Ould{-}Khaoua and Lewis M. Mackenzie}, title = {Algorithmic construction of Hamiltonians in pyramids}, journal = {Inf. Process. Lett.}, volume = {80}, number = {2}, pages = {75--79}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00149-1}, doi = {10.1016/S0020-0190(01)00149-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Sarbazi-AzadOM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Seynhaeve01, author = {Franck Seynhaeve}, title = {Set constraints and topology}, journal = {Inf. Process. Lett.}, volume = {80}, number = {3}, pages = {145--150}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00157-0}, doi = {10.1016/S0020-0190(01)00157-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Seynhaeve01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Smart01, author = {Nigel P. Smart}, title = {A note on the x-coordinate of points on an elliptic curve in characteristic two}, journal = {Inf. Process. Lett.}, volume = {80}, number = {5}, pages = {261--263}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00169-7}, doi = {10.1016/S0020-0190(01)00169-7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Smart01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/VascoS01, author = {Mar{\'{\i}}a Isabel Gonz{\'{a}}lez Vasco and Rainer Steinwandt}, title = {Clouds over a public key cryptosystem based on Lyndon words}, journal = {Inf. Process. Lett.}, volume = {80}, number = {5}, pages = {239--242}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00170-3}, doi = {10.1016/S0020-0190(01)00170-3}, timestamp = {Mon, 31 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/VascoS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/VoorhoeveM01, author = {Marc Voorhoeve and Sjouke Mauw}, title = {Impossible futures and determinism}, journal = {Inf. Process. Lett.}, volume = {80}, number = {1}, pages = {51--58}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00217-4}, doi = {10.1016/S0020-0190(01)00217-4}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/VoorhoeveM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/WangC01, author = {Guoqing Wang and T. C. Edwin Cheng}, title = {Heuristics for two-machine no-wait flowshop scheduling with an availability constraint}, journal = {Inf. Process. Lett.}, volume = {80}, number = {6}, pages = {305--309}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00181-8}, doi = {10.1016/S0020-0190(01)00181-8}, timestamp = {Tue, 06 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/WangC01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/ZobelHW01, author = {Justin Zobel and Steffen Heinz and Hugh E. Williams}, title = {In-memory hash tables for accumulating text vocabularies}, journal = {Inf. Process. Lett.}, volume = {80}, number = {6}, pages = {271--277}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00239-3}, doi = {10.1016/S0020-0190(01)00239-3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/ZobelHW01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/Zwaag01, author = {Mark van der Zwaag}, title = {The cones and foci proof technique for timed transition systems}, journal = {Inf. Process. Lett.}, volume = {80}, number = {1}, pages = {33--40}, year = {2001}, url = {https://doi.org/10.1016/S0020-0190(01)00215-0}, doi = {10.1016/S0020-0190(01)00215-0}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/Zwaag01.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.