Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/rsa/rsa6.bht:"
download as .bib file
@article{DBLP:journals/rsa/AlonFW95,
author = {Noga Alon and
Alan M. Frieze and
Dominic Welsh},
title = {Polynomial Time Randomized Approximation Schemes for Tutte-Gr{\"{o}}thendieck
Invariants: The Dense Case},
journal = {Random Struct. Algorithms},
volume = {6},
number = {4},
pages = {459--478},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060409},
doi = {10.1002/RSA.3240060409},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AlonFW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonS95,
author = {Noga Alon and
Benny Sudakov},
title = {Disjoint Systems},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {13--20},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060103},
doi = {10.1002/RSA.3240060103},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonT95,
author = {Noga Alon and
Zsolt Tuza},
title = {The Acyclic Orientation Game on Random Graphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {261--268},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060213},
doi = {10.1002/RSA.3240060213},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AronsonDFS95,
author = {Jonathan Aronson and
Martin E. Dyer and
Alan M. Frieze and
Stephen Suen},
title = {Randomized Greedy Matching {II}},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {55--74},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060107},
doi = {10.1002/RSA.3240060107},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/AronsonDFS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BleiPS95,
author = {Ron Blei and
Yuval Peres and
James H. Schmerl},
title = {Fractional Products of Sets},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {113--120},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060111},
doi = {10.1002/RSA.3240060111},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BleiPS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasKL95,
author = {B{\'{e}}la Bollob{\'{a}}s and
Yoshiharu Kohayakawa and
Tomasz Luczak},
title = {Connectivity Properties of Random Subgraphs of the Cube},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {221--230},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060210},
doi = {10.1002/RSA.3240060210},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasKL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BollobasT95,
author = {B{\'{e}}la Bollob{\'{a}}s and
Andrew Thomason},
title = {Generalized Chromatic Numbers of Random Graphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {353--356},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060222},
doi = {10.1002/RSA.3240060222},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BollobasT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Brightwell95,
author = {Graham R. Brightwell},
title = {Random Graph Orders Do Not Satisfy a 0-1 Law},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {231--238},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060211},
doi = {10.1002/RSA.3240060211},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Brightwell95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CanfieldH95,
author = {E. Rodney Canfield and
L. H. Harper},
title = {Large Antichains in the Partition Lattice},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {89--104},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060109},
doi = {10.1002/RSA.3240060109},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/CanfieldH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Cooper95,
author = {Colin Cooper},
title = {On the 2-Cyclic Property in 2-Regular Digraphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {4},
pages = {439--448},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060407},
doi = {10.1002/RSA.3240060407},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Cooper95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DancekP95,
author = {Vlado Danc{\'{\i}}k and
Mike Paterson},
title = {Upper Bounds for the Expected Length of a Longest Common Subsequence
of Two Binary Sequences},
journal = {Random Struct. Algorithms},
volume = {6},
number = {4},
pages = {449--458},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060408},
doi = {10.1002/RSA.3240060408},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DancekP95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Drmota95,
author = {Michael Drmota},
title = {Correlations on the Strata of a Random Mapping},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {357--366},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060223},
doi = {10.1002/RSA.3240060223},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Drmota95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DukeLR95,
author = {Richard A. Duke and
Hanno Lefmann and
Vojtech R{\"{o}}dl},
title = {On Uncrowded Hypergraphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {209--212},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060208},
doi = {10.1002/RSA.3240060208},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DukeLR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ErdosR95,
author = {Paul Erd{\"{o}}s and
Vojtech R{\"{o}}dl},
title = {Covering of r-Graphs by Complete r-Partite Subgraphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {319--322},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060218},
doi = {10.1002/RSA.3240060218},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ErdosR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ErdosSW95,
author = {Paul Erd{\"{o}}s and
Stephen Suen and
Peter Winkler},
title = {On the Size of a Random Maximal Graph},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {309--318},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060217},
doi = {10.1002/RSA.3240060217},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ErdosSW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Feige95,
author = {Uriel Feige},
title = {A Tight Upper Bound on the Cover Time for Random Walks on Graphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {51--54},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060106},
doi = {10.1002/RSA.3240060106},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Feige95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Feige95a,
author = {Uriel Feige},
title = {A Tight Lower Bound on the Cover Time for Random Walks on Graphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {4},
pages = {433--438},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060406},
doi = {10.1002/RSA.3240060406},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Feige95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Grable95,
author = {David A. Grable},
title = {The Diameter of a Random Graph with Bounded Diameter},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {193--200},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060206},
doi = {10.1002/RSA.3240060206},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Grable95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/HaxellK95,
author = {Penny E. Haxell and
Yoshiharu Kohayakawa},
title = {On the Anti-Ramsey Property of Ramanujan Graphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {4},
pages = {417--432},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060405},
doi = {10.1002/RSA.3240060405},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/HaxellK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Holst95,
author = {Lars Holst},
title = {The General Birthday Problem},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {201--208},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060207},
doi = {10.1002/RSA.3240060207},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Holst95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Janson95a,
author = {Svante Janson},
title = {Hamilton Cycles in a Random Tournament},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {213--220},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060209},
doi = {10.1002/RSA.3240060209},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Janson95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Janson95b,
author = {Svante Janson},
title = {A Graph Fourier Transform and Proportional Graphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {341--352},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060221},
doi = {10.1002/RSA.3240060221},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Janson95b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kemp95,
author = {Rainer Kemp},
title = {On the Inner Structure of Multidimensional Simply Generated Trees},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {121--146},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060202},
doi = {10.1002/RSA.3240060202},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kemp95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kolchin95,
author = {Valentin F. Kolchin},
title = {On Classification in Presence of Measurement Errors},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {147--160},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060203},
doi = {10.1002/RSA.3240060203},
timestamp = {Mon, 22 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kolchin95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kordecki95,
author = {Wojciech Kordecki},
title = {Maximal Full Subspaces in Random Projective Spaces- Thresholds and
Poisson Approximation},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {297--308},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060216},
doi = {10.1002/RSA.3240060216},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kordecki95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Kostochka95,
author = {Alexandr V. Kostochka},
title = {The Number of Spanning Trees in Graphs with Given Degree Sequence},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {269--274},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060214},
doi = {10.1002/RSA.3240060214},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Kostochka95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LuczakS95,
author = {Tomasz Luczak and
Saharon Shelah},
title = {Convergence in Homogeneous Random Graphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {4},
pages = {371--393},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060402},
doi = {10.1002/RSA.3240060402},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LuczakS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Lynch95,
author = {James F. Lynch},
title = {On the Threshold of Chaos in Random Boolean Cellular Automata},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {239--260},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060212},
doi = {10.1002/RSA.3240060212},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Lynch95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Maier95,
author = {Robert S. Maier},
title = {The Shape of Stretched Planar Trees},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {331--340},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060220},
doi = {10.1002/RSA.3240060220},
timestamp = {Thu, 05 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Maier95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MolloyR95a,
author = {Michael Molloy and
Bruce A. Reed},
title = {A Critical Point for Random Graphs with a Given Degree Sequence},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {161--180},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060204},
doi = {10.1002/RSA.3240060204},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MolloyR95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/NaorR95,
author = {Joseph Naor and
Ron M. Roth},
title = {Constructions of Permutation Arrays for Certain Scheduling Cost Measures},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {39--50},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060105},
doi = {10.1002/RSA.3240060105},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/NaorR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Odlyzko95,
author = {Andrew M. Odlyzko},
title = {Search for the Maximum of a Random Walk},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {275--296},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060215},
doi = {10.1002/RSA.3240060215},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Odlyzko95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Preater95,
author = {John Preater},
title = {A Passage Time for Greedy-Coloring Cycles},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {105--112},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060110},
doi = {10.1002/RSA.3240060110},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Preater95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PromelS95,
author = {Hans J{\"{u}}rgen Pr{\"{o}}mel and
Angelika Steger},
title = {Random I-Cororable Graphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {21--38},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060104},
doi = {10.1002/RSA.3240060104},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PromelS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RodlT95,
author = {Vojtech R{\"{o}}dl and
Robin Thomas},
title = {On the Genus of a Random Graph},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {1--12},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060102},
doi = {10.1002/RSA.3240060102},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RodlT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Santha95,
author = {Miklos Santha},
title = {On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {75--88},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060108},
doi = {10.1002/RSA.3240060108},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Santha95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Savicky95,
author = {Petr Savick{\'{y}}},
title = {Improved Boolean Formulas for the Ramsey Graphs},
journal = {Random Struct. Algorithms},
volume = {6},
number = {4},
pages = {407--416},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060404},
doi = {10.1002/RSA.3240060404},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Savicky95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TokuyamaN95,
author = {Takeshi Tokuyama and
Jun Nakano},
title = {Geometric Algorithms for the Minimum Cost Assignment Problem},
journal = {Random Struct. Algorithms},
volume = {6},
number = {4},
pages = {393--406},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060403},
doi = {10.1002/RSA.3240060403},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/TokuyamaN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Tuza95,
author = {Zsolt Tuza},
title = {How to Make {A} Random Graph Irregular},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {323--330},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060219},
doi = {10.1002/RSA.3240060219},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Tuza95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Tyszkiewicz95,
author = {Jerzy Tyszkiewicz},
title = {Probabilities in First-Order Logic of a Unary Function and a Binary
Relation},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {181--192},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060205},
doi = {10.1002/RSA.3240060205},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Tyszkiewicz95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-06-04 14:44 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
