![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/njc/njc5.bht:"
@article{DBLP:journals/njc/AbadiG98, author = {Mart{\'{\i}}n Abadi and Andrew D. Gordon}, title = {A Bisimulation Method for Cryptographic Protocols}, journal = {Nord. J. Comput.}, volume = {5}, number = {4}, pages = {267}, year = {1998}, timestamp = {Mon, 14 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/AbadiG98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/Baeza-YatesS98, author = {Ricardo A. Baeza{-}Yates and Hector Soza{-}Pollman}, title = {Analysis of Linear Hashing Revisited}, journal = {Nord. J. Comput.}, volume = {5}, number = {1}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/Baeza-YatesS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/DahlOB98, author = {Ole{-}Johan Dahl and Olaf Owe and Tore J. Bastiansen}, title = {Subtyping and Constructive Specification}, journal = {Nord. J. Comput.}, volume = {5}, number = {1}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/DahlOB98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/DobrevR98, author = {Stefan Dobrev and Peter Ruzicka}, title = {On the Communication Complexity of Strong Time-Optimal Distributed Algorithms}, journal = {Nord. J. Comput.}, volume = {5}, number = {2}, pages = {87--104}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/DobrevR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/FechtS98, author = {Christian Fecht and Helmut Seidl}, title = {Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems}, journal = {Nord. J. Comput.}, volume = {5}, number = {4}, pages = {304--329}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/FechtS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/GanleyS98, author = {Joseph L. Ganley and Jeffrey S. Salowe}, title = {The Power-p Steiner Tree Problem}, journal = {Nord. J. Comput.}, volume = {5}, number = {2}, pages = {115--127}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/GanleyS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/Gonzalez98, author = {Teofilo F. Gonzalez}, title = {Bounded Fan-Out Multimessage Multicasting}, journal = {Nord. J. Comput.}, volume = {5}, number = {3}, pages = {196--213}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/Gonzalez98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/Hankin98, author = {Chris Hankin}, title = {Guest Editor's Foreword}, journal = {Nord. J. Comput.}, volume = {5}, number = {4}, pages = {265--266}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/Hankin98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/HeggernesT98, author = {Pinar Heggernes and Jan Arne Telle}, title = {Partitioning Graphs into Generalized Dominating Sets}, journal = {Nord. J. Comput.}, volume = {5}, number = {2}, pages = {128--142}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/HeggernesT98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/HoyerL98, author = {Peter H{\o}yer and Kim S. Larsen}, title = {Parametric Permutation Routing via Matchings}, journal = {Nord. J. Comput.}, volume = {5}, number = {2}, pages = {105--114}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/HoyerL98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/JohnssonMN98, author = {Mika Johnsson and G{\'{a}}bor Magyar and Olli Nevalainen}, title = {On the Euclidean 3-Matching Problem}, journal = {Nord. J. Comput.}, volume = {5}, number = {2}, pages = {143}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/JohnssonMN98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/KratochvilPT98, author = {Jan Kratochv{\'{\i}}l and Andrzej Proskurowski and Jan Arne Telle}, title = {On the Complexity of Graph Covering Problems}, journal = {Nord. J. Comput.}, volume = {5}, number = {3}, pages = {173--195}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/KratochvilPT98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/KristoffersenD98, author = {Bj{\o}rn Kristoffersen and Ole{-}Johan Dahl}, title = {On Introducing Higher Order Functions in {ABEL}}, journal = {Nord. J. Comput.}, volume = {5}, number = {1}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/KristoffersenD98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/KrznaricL98, author = {Drago Krznaric and Christos Levcopoulos}, title = {Computing a Threaded Quadtree from the Delaunay Triangulation in linear Time}, journal = {Nord. J. Comput.}, volume = {5}, number = {1}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/KrznaricL98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/Leino98, author = {K. Rustan M. Leino}, title = {Recursive Object Types in a Logic of Object-Oriented Programs}, journal = {Nord. J. Comput.}, volume = {5}, number = {4}, pages = {330--360}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/Leino98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/Mossin98, author = {Christian Mossin}, title = {Higher-Order Value Flow Graphs}, journal = {Nord. J. Comput.}, volume = {5}, number = {3}, pages = {214--234}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/Mossin98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/PaakkiT98, author = {Jukka Paakki and Antti{-}Pekka Tuovinen}, title = {Source-to-Source Translation of Visual Languages}, journal = {Nord. J. Comput.}, volume = {5}, number = {3}, pages = {235}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/PaakkiT98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/njc/RossS98, author = {John L. Ross and Shmuel Sagiv}, title = {Building a Bridge between Pointer Aliases and Program Dependences}, journal = {Nord. J. Comput.}, volume = {5}, number = {4}, pages = {361}, year = {1998}, timestamp = {Wed, 14 Jan 2004 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/njc/RossS98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.