Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jason I. Brown
@article{DBLP:journals/networks/BrownM23,
author = {Jason I. Brown and
Isaac McMullin},
title = {On the split reliability of graphs},
journal = {Networks},
volume = {82},
number = {2},
pages = {177--185},
year = {2023},
url = {https://doi.org/10.1002/net.22166},
doi = {10.1002/NET.22166},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BrownM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-13691,
author = {Jason I. Brown and
Ian George},
title = {Modulation Graphs in Popular Music},
journal = {CoRR},
volume = {abs/2306.13691},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.13691},
doi = {10.48550/ARXIV.2306.13691},
eprinttype = {arXiv},
eprint = {2306.13691},
timestamp = {Tue, 27 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-13691.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Brown22,
author = {Jason I. Brown},
title = {Maximal intervals of decrease and inflection points for node reliability},
journal = {Discret. Appl. Math.},
volume = {313},
pages = {40--44},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.02.002},
doi = {10.1016/J.DAM.2022.02.002},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Brown22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BeatonB22,
author = {Iain Beaton and
Jason I. Brown},
title = {On the Unimodality of Domination Polynomials},
journal = {Graphs Comb.},
volume = {38},
number = {3},
pages = {90},
year = {2022},
url = {https://doi.org/10.1007/s00373-022-02487-x},
doi = {10.1007/S00373-022-02487-X},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BeatonB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cdm/BrownB21,
author = {Jason I. Brown and
Iain Beaton},
title = {On the real roots of domination polynomials},
journal = {Contributions Discret. Math.},
volume = {16},
number = {3},
pages = {175--182},
year = {2021},
url = {https://cdm.ucalgary.ca/article/view/72075},
timestamp = {Fri, 04 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cdm/BrownB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BeatonB21,
author = {Iain Beaton and
Jason I. Brown},
title = {The average order of dominating sets of a graph},
journal = {Discret. Math.},
volume = {344},
number = {12},
pages = {112595},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2021.112595},
doi = {10.1016/J.DISC.2021.112595},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BeatonB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownCCGM21,
author = {Jason I. Brown and
Charles J. Colbourn and
Danielle Cox and
Christina Graves and
Lucas Mol},
title = {Network reliability: Heading out on the highway},
journal = {Networks},
volume = {77},
number = {1},
pages = {146--160},
year = {2021},
url = {https://doi.org/10.1002/net.21977},
doi = {10.1002/NET.21977},
timestamp = {Thu, 31 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/BrownCCGM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownD21,
author = {Jason I. Brown and
Corey D. C. DeGagn{\'{e}}},
title = {Roots of two-terminal reliability polynomials},
journal = {Networks},
volume = {78},
number = {2},
pages = {153--163},
year = {2021},
url = {https://doi.org/10.1002/net.22004},
doi = {10.1002/NET.22004},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownC20,
author = {Jason I. Brown and
Ben Cameron},
title = {A note on purely imaginary independence roots},
journal = {Discret. Math.},
volume = {343},
number = {12},
pages = {112113},
year = {2020},
url = {https://doi.org/10.1016/j.disc.2020.112113},
doi = {10.1016/J.DISC.2020.112113},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BrownM20,
author = {Jason I. Brown and
Lucas Mol},
title = {On the roots of the subtree polynomial},
journal = {Eur. J. Comb.},
volume = {89},
pages = {103181},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2020.103181},
doi = {10.1016/J.EJC.2020.103181},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/BrownM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrownC20,
author = {Jason I. Brown and
Ben Cameron},
title = {Maximum Modulus of Independence Roots of Graphs and Trees},
journal = {Graphs Comb.},
volume = {36},
number = {3},
pages = {877--894},
year = {2020},
url = {https://doi.org/10.1007/s00373-020-02160-1},
doi = {10.1007/S00373-020-02160-1},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrownC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BeatonBC20,
author = {Iain Beaton and
Jason I. Brown and
Danielle Cox},
title = {Optimal Domination Polynomials},
journal = {Graphs Comb.},
volume = {36},
number = {5},
pages = {1477--1487},
year = {2020},
url = {https://doi.org/10.1007/s00373-020-02202-8},
doi = {10.1007/S00373-020-02202-8},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BeatonBC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrownW20,
author = {Jason I. Brown and
David G. Wagner},
title = {On the imaginary parts of chromatic roots},
journal = {J. Graph Theory},
volume = {93},
number = {2},
pages = {299--311},
year = {2020},
url = {https://doi.org/10.1002/jgt.22487},
doi = {10.1002/JGT.22487},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BrownW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownD20,
author = {Jason I. Brown and
Corey D. C. DeGagn{\'{e}}},
title = {Rational roots of all-terminal reliability},
journal = {Networks},
volume = {76},
number = {1},
pages = {75--83},
year = {2020},
url = {https://doi.org/10.1002/net.21938},
doi = {10.1002/NET.21938},
timestamp = {Wed, 15 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/BeatonB19,
author = {Iain Beaton and
Jason I. Brown},
title = {The domination equivalence classes of paths},
journal = {Australas. {J} Comb.},
volume = {73},
pages = {291--312},
year = {2019},
url = {http://ajc.maths.uq.edu.au/pdf/73/ajc\_v73\_p291.pdf},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/BeatonB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/BeatonBC19,
author = {Iain Beaton and
Jason I. Brown and
Ben Cameron},
title = {Independence equivalence classes of paths and cycles},
journal = {Australas. {J} Comb.},
volume = {75},
pages = {127--145},
year = {2019},
url = {http://ajc.maths.uq.edu.au/pdf/75/ajc\_v75\_p127.pdf},
timestamp = {Mon, 22 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/BeatonBC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownD19,
author = {Jason I. Brown and
Corey D. C. DeGagn{\'{e}}},
title = {On the reliability roots of simplicial complexes and matroids},
journal = {Discret. Math.},
volume = {342},
number = {8},
pages = {2356--2370},
year = {2019},
url = {https://doi.org/10.1016/j.disc.2019.05.002},
doi = {10.1016/J.DISC.2019.05.002},
timestamp = {Tue, 16 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1906-05427,
author = {Mark E. Glickman and
Jason I. Brown and
Ryan B. Song},
title = {{(A)} Data in the Life: Authorship Attribution of Lennon-McCartney
Songs},
journal = {CoRR},
volume = {abs/1906.05427},
year = {2019},
url = {http://arxiv.org/abs/1906.05427},
eprinttype = {arXiv},
eprint = {1906.05427},
timestamp = {Mon, 24 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1906-05427.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BrownC18,
author = {Jason I. Brown and
Ben Cameron},
title = {On the Stability of Independence Polynomials},
journal = {Electron. J. Comb.},
volume = {25},
number = {1},
pages = {1},
year = {2018},
url = {https://doi.org/10.37236/7280},
doi = {10.37236/7280},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BrownC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrownM18,
author = {Jason I. Brown and
Lucas Mol},
title = {The shape of node reliability},
journal = {Discret. Appl. Math.},
volume = {238},
pages = {41--55},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.11.035},
doi = {10.1016/J.DAM.2017.11.035},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrownM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownC18,
author = {Jason I. Brown and
Ben Cameron},
title = {On the unimodality of independence polynomials of very well-covered
graphs},
journal = {Discret. Math.},
volume = {341},
number = {4},
pages = {1138--1143},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2017.10.007},
doi = {10.1016/J.DISC.2017.10.007},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownMO18,
author = {Jason I. Brown and
Lucas Mol and
Ortrud R. Oellermann},
title = {On the roots of Wiener polynomials of graphs},
journal = {Discret. Math.},
volume = {341},
number = {9},
pages = {2398--2408},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2018.05.014},
doi = {10.1016/J.DISC.2018.05.014},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownMO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrownC18,
author = {Jason I. Brown and
Danielle Cox},
title = {Optimal Graphs for Independence and \emph{k}-Independence Polynomials},
journal = {Graphs Comb.},
volume = {34},
number = {6},
pages = {1445--1457},
year = {2018},
url = {https://doi.org/10.1007/s00373-018-1946-0},
doi = {10.1007/S00373-018-1946-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrownC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrownE17,
author = {Jason I. Brown and
Aysel Erey},
title = {Restraints permitting the largest number of colourings},
journal = {Discret. Appl. Math.},
volume = {222},
pages = {76--88},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.01.022},
doi = {10.1016/J.DAM.2017.01.022},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrownE17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownM17,
author = {Jason I. Brown and
Lucas Mol},
title = {On the roots of all-terminal reliability polynomials},
journal = {Discret. Math.},
volume = {340},
number = {6},
pages = {1287--1299},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2017.01.024},
doi = {10.1016/J.DISC.2017.01.024},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrownE16,
author = {Jason I. Brown and
Aysel Erey},
title = {On the Real Roots of {\(\sigma\)} -Polynomials},
journal = {Graphs Comb.},
volume = {32},
number = {5},
pages = {1723--1730},
year = {2016},
url = {https://doi.org/10.1007/s00373-016-1684-0},
doi = {10.1007/S00373-016-1684-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrownE16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrownE16,
author = {Jason I. Brown and
Aysel Erey},
title = {On the Roots of {\(\sigma\)}-Polynomials},
journal = {J. Graph Theory},
volume = {82},
number = {1},
pages = {90--102},
year = {2016},
url = {https://doi.org/10.1002/jgt.21889},
doi = {10.1002/JGT.21889},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BrownE16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownC16,
author = {Jason I. Brown and
Danielle Cox},
title = {Inflection points of reliability polynomials are dense in [0, 1]},
journal = {Networks},
volume = {67},
number = {4},
pages = {266--269},
year = {2016},
url = {https://doi.org/10.1002/net.21669},
doi = {10.1002/NET.21669},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownM16,
author = {Jason I. Brown and
Lucas Mol},
title = {On the roots of the node reliability polynomial},
journal = {Networks},
volume = {68},
number = {3},
pages = {238--246},
year = {2016},
url = {https://doi.org/10.1002/net.21697},
doi = {10.1002/NET.21697},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownO15,
author = {Jason I. Brown and
Ortrud R. Oellermann},
title = {On the spectrum and number of convex sets in graphs},
journal = {Discret. Math.},
volume = {338},
number = {7},
pages = {1144--1153},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.01.024},
doi = {10.1016/J.DISC.2015.01.024},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownE15,
author = {Jason I. Brown and
Aysel Erey},
title = {New bounds for chromatic polynomials and chromatic roots},
journal = {Discret. Math.},
volume = {338},
number = {11},
pages = {1938--1946},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.04.021},
doi = {10.1016/J.DISC.2015.04.021},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrownCE14,
author = {Jason I. Brown and
Danielle Cox and
Richard Ehrenborg},
title = {The average reliability of a graph},
journal = {Discret. Appl. Math.},
volume = {177},
pages = {19--33},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.05.048},
doi = {10.1016/J.DAM.2014.05.048},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrownCE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownE14,
author = {Jason I. Brown and
Aysel Erey},
title = {A note on the real part of complex chromatic roots},
journal = {Discret. Math.},
volume = {328},
pages = {96--101},
year = {2014},
url = {https://doi.org/10.1016/j.disc.2014.04.007},
doi = {10.1016/J.DISC.2014.04.007},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BonatoBMP14,
author = {Anthony Bonato and
Jason I. Brown and
Dieter Mitsche and
Pawel Pralat},
title = {Independence densities of hypergraphs},
journal = {Eur. J. Comb.},
volume = {40},
pages = {124--136},
year = {2014},
url = {https://doi.org/10.1016/j.ejc.2014.03.001},
doi = {10.1016/J.EJC.2014.03.001},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/BonatoBMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrownT14,
author = {Jason I. Brown and
Julia Tufts},
title = {On the Roots of Domination Polynomials},
journal = {Graphs Comb.},
volume = {30},
number = {3},
pages = {527--547},
year = {2014},
url = {https://doi.org/10.1007/s00373-013-1306-z},
doi = {10.1007/S00373-013-1306-Z},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrownT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BrownO14,
author = {Jason I. Brown and
Ortrud R. Oellermann},
title = {Graphs with a Minimal Number of Convex Sets},
journal = {Graphs Comb.},
volume = {30},
number = {6},
pages = {1383--1397},
year = {2014},
url = {https://doi.org/10.1007/s00373-013-1356-2},
doi = {10.1007/S00373-013-1356-2},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BrownO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownC14,
author = {Jason I. Brown and
Danielle Cox},
title = {Nonexistence of optimal graphs for all terminal reliability},
journal = {Networks},
volume = {63},
number = {2},
pages = {146--153},
year = {2014},
url = {https://doi.org/10.1002/net.21530},
doi = {10.1002/NET.21530},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/telsys/BrownKK14,
author = {Jason I. Brown and
Yakup Ko{\c{c}} and
Robert E. Kooij},
title = {Inflection points for network reliability},
journal = {Telecommun. Syst.},
volume = {56},
number = {1},
pages = {79--84},
year = {2014},
url = {https://doi.org/10.1007/s11235-013-9820-0},
doi = {10.1007/S11235-013-9820-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/telsys/BrownKK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrownDM13,
author = {Jason I. Brown and
Karl Dilcher and
Dante V. Manna},
title = {On the Roots of Expected Independence Polynomials},
journal = {J. Graph Theory},
volume = {73},
number = {3},
pages = {322--326},
year = {2013},
url = {https://doi.org/10.1002/jgt.21678},
doi = {10.1002/JGT.21678},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BrownDM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BrownH12,
author = {Jason I. Brown and
Richard Hoshino},
title = {On Circulants Uniquely Characterized by their Independence Polynomials},
journal = {Ars Comb.},
volume = {104},
pages = {363--374},
year = {2012},
timestamp = {Mon, 18 Jan 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/BrownH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BrownH12a,
author = {Jason I. Brown and
Richard Hoshino},
title = {Line Graphs and Circulants},
journal = {Ars Comb.},
volume = {105},
pages = {463--476},
year = {2012},
timestamp = {Mon, 18 Jan 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/BrownH12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownH11,
author = {Jason I. Brown and
Richard Hoshino},
title = {Well-covered circulant graphs},
journal = {Discret. Math.},
volume = {311},
number = {4},
pages = {244--251},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2010.11.007},
doi = {10.1016/J.DISC.2010.11.007},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icumt/BrownKK11,
author = {Jason I. Brown and
Yakup Koc and
Robert E. Kooij},
title = {Reliability polynomials crossing more than twice},
booktitle = {3rd International Congress on Ultra Modern Telecommunications and
Control Systems and Workshops, {ICUMT} 2011, Budapest, Hungary, October
5-7, 2011},
pages = {1--6},
publisher = {{IEEE}},
year = {2011},
url = {https://ieeexplore.ieee.org/document/6078860/},
timestamp = {Tue, 10 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icumt/BrownKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrownH10,
author = {Jason I. Brown and
Richard Hoshino},
title = {Proof of a conjecture on fractional Ramsey numbers},
journal = {J. Graph Theory},
volume = {63},
number = {2},
pages = {164--178},
year = {2010},
url = {https://doi.org/10.1002/jgt.20416},
doi = {10.1002/JGT.20416},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BrownH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/disopt/BrownCN09,
author = {Jason I. Brown and
Charles J. Colbourn and
Richard J. Nowakowski},
title = {Chip firing and all-terminal network reliability bounds},
journal = {Discret. Optim.},
volume = {6},
number = {4},
pages = {436--445},
year = {2009},
url = {https://doi.org/10.1016/j.disopt.2009.05.003},
doi = {10.1016/J.DISOPT.2009.05.003},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/disopt/BrownCN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownH09,
author = {Jason I. Brown and
R. Hoshino},
title = {Nordhaus-Gaddum inequalities for the fractional and circular chromatic
numbers},
journal = {Discret. Math.},
volume = {309},
number = {8},
pages = {2223--2232},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.04.052},
doi = {10.1016/J.DISC.2008.04.052},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownH09a,
author = {Jason I. Brown and
Richard Hoshino},
title = {Independence polynomials of circulants with an application to music},
journal = {Discret. Math.},
volume = {309},
number = {8},
pages = {2292--2304},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.05.003},
doi = {10.1016/J.DISC.2008.05.003},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownH09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownC09,
author = {Jason I. Brown and
Danielle Cox},
title = {The closure of the set of roots of strongly connected reliability
polynomials is the entire complex plane},
journal = {Discret. Math.},
volume = {309},
number = {16},
pages = {5043--5047},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2009.03.012},
doi = {10.1016/J.DISC.2009.03.012},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BrownS09,
author = {Jason I. Brown and
Bruce E. Sagan},
title = {Monomial bases for broken circuit complexes},
journal = {Eur. J. Comb.},
volume = {30},
number = {8},
pages = {1786--1800},
year = {2009},
url = {https://doi.org/10.1016/j.ejc.2008.12.009},
doi = {10.1016/J.EJC.2008.12.009},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/BrownS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownD09,
author = {Jason I. Brown and
Karl Dilcher},
title = {On the roots of strongly connected reliability polynomials},
journal = {Networks},
volume = {54},
number = {2},
pages = {108--116},
year = {2009},
url = {https://doi.org/10.1002/net.20301},
doi = {10.1002/NET.20301},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/BrownN08,
author = {Jason I. Brown and
Richard J. Nowakowski},
title = {The neighbourhood polynomial of a graph},
journal = {Australas. {J} Comb.},
volume = {42},
pages = {55--68},
year = {2008},
url = {http://ajc.maths.uq.edu.au/pdf/42/ajc\_v42\_p055.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/BrownN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BrownH07,
author = {Jason I. Brown and
Richard Hoshino},
title = {The Ehrenfeucht-Fraisse Game for Paths and Cycles},
journal = {Ars Comb.},
volume = {83},
year = {2007},
timestamp = {Mon, 18 Jan 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/BrownH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownN07,
author = {Jason I. Brown and
Richard J. Nowakowski},
title = {The well-covered dimension of random graphs},
journal = {Discret. Math.},
volume = {307},
number = {3-5},
pages = {352--355},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.09.026},
doi = {10.1016/J.DISC.2005.09.026},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownNZ07,
author = {Jason I. Brown and
Richard J. Nowakowski and
Igor E. Zverovich},
title = {The structure of well-covered graphs with no cycles of length 4},
journal = {Discret. Math.},
volume = {307},
number = {17-18},
pages = {2235--2245},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2006.10.011},
doi = {10.1016/J.DISC.2006.10.011},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownNZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownL07,
author = {Jason I. Brown and
Xiaohu Li},
title = {Uniformly optimal digraphs for strongly connected reliability},
journal = {Networks},
volume = {49},
number = {2},
pages = {145--151},
year = {2007},
url = {https://doi.org/10.1002/net.20148},
doi = {10.1002/NET.20148},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BrownN05,
author = {Jason I. Brown and
Richard J. Nowakowski},
title = {Average independence polynomials},
journal = {J. Comb. Theory, Ser. {B}},
volume = {93},
number = {2},
pages = {313--318},
year = {2005},
url = {https://doi.org/10.1016/j.jctb.2004.10.001},
doi = {10.1016/J.JCTB.2004.10.001},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BrownN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownL05,
author = {Jason I. Brown and
Xiaohu Li},
title = {The strongly connected reliability of complete digraphs},
journal = {Networks},
volume = {45},
number = {3},
pages = {165--168},
year = {2005},
url = {https://doi.org/10.1002/net.20060},
doi = {10.1002/NET.20060},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrownN05,
author = {Jason I. Brown and
Richard J. Nowakowski},
title = {Well-Covered Vector Spaces of Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {952--965},
year = {2005},
url = {https://doi.org/10.1137/S0895480101393039},
doi = {10.1137/S0895480101393039},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrownN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownHN04,
author = {Jason I. Brown and
Carl A. Hickman and
Richard J. Nowakowski},
title = {The \emph{k}-fractal of a simplicial complex},
journal = {Discret. Math.},
volume = {285},
number = {1-3},
pages = {33--45},
year = {2004},
url = {https://doi.org/10.1016/j.disc.2003.12.014},
doi = {10.1016/J.DISC.2003.12.014},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownHN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BrownHN03,
author = {Jason I. Brown and
Carl A. Hickman and
Richard J. Nowakowski},
title = {The independence fractal of a graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {87},
number = {2},
pages = {209--230},
year = {2003},
url = {https://doi.org/10.1016/S0095-8956(02)00014-X},
doi = {10.1016/S0095-8956(02)00014-X},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BrownHN03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BrownH02,
author = {Jason I. Brown and
Carl A. Hickman},
title = {On chromatic roots with negative real part},
journal = {Ars Comb.},
volume = {63},
year = {2002},
timestamp = {Tue, 02 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/BrownH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownH02,
author = {Jason I. Brown and
Carl A. Hickman},
title = {On chromatic roots of large subdivisions of graphs},
journal = {Discret. Math.},
volume = {242},
number = {1-3},
pages = {17--30},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(00)00402-7},
doi = {10.1016/S0012-365X(00)00402-7},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/BrownN01,
author = {Jason I. Brown and
Richard J. Nowakowski},
title = {Bounding the Roots of Independence Polynomials},
journal = {Ars Comb.},
volume = {58},
year = {2001},
timestamp = {Fri, 12 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/BrownN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BrownHSW01,
author = {Jason I. Brown and
Carl A. Hickman and
Alan D. Sokal and
David G. Wagner},
title = {On the Chromatic Roots of Generalized Theta Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {83},
number = {2},
pages = {272--297},
year = {2001},
url = {https://doi.org/10.1006/jctb.2001.2057},
doi = {10.1006/JCTB.2001.2057},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BrownHSW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Brown99a,
author = {Jason I. Brown},
title = {Subdivisions and Chromatic Roots},
journal = {J. Comb. Theory, Ser. {B}},
volume = {76},
number = {2},
pages = {201--204},
year = {1999},
url = {https://doi.org/10.1006/jctb.1999.1901},
doi = {10.1006/JCTB.1999.1901},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Brown99a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AchlioptasBCM98,
author = {Dimitris Achlioptas and
Jason I. Brown and
Derek G. Corneil and
Michael Molloy},
title = {The existence of uniquely -G colourable graphs},
journal = {Discret. Math.},
volume = {179},
number = {1-3},
pages = {1--11},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00022-8},
doi = {10.1016/S0012-365X(97)00022-8},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/AchlioptasBCM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Brown98,
author = {Jason I. Brown},
title = {Chromatic polynomials and order ideals of monomials},
journal = {Discret. Math.},
volume = {189},
number = {1-3},
pages = {43--68},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00277-X},
doi = {10.1016/S0012-365X(97)00277-X},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Brown98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Brown98,
author = {Jason I. Brown},
title = {On the Roots of Chromatic Polynomials},
journal = {J. Comb. Theory, Ser. {B}},
volume = {72},
number = {2},
pages = {251--256},
year = {1998},
url = {https://doi.org/10.1006/jctb.1997.1813},
doi = {10.1006/JCTB.1997.1813},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Brown98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Brown96,
author = {Jason I. Brown},
title = {The Complexity of Generalized Graph Colorings},
journal = {Discret. Appl. Math.},
volume = {69},
number = {3},
pages = {257--270},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(96)00096-0},
doi = {10.1016/0166-218X(96)00096-0},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Brown96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownW96,
author = {Jason I. Brown and
Stephen Watson},
title = {The number of complements of a topology on n points is at least 2\({}^{\mbox{n}}\)
(except for some special cases)},
journal = {Discret. Math.},
volume = {154},
number = {1-3},
pages = {27--39},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00004-G},
doi = {10.1016/0012-365X(95)00004-G},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrownNR96,
author = {Jason I. Brown and
Richard J. Nowakowski and
Douglas F. Rall},
title = {The Ultimate Categorical Independence Ratio of a Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {9},
number = {2},
pages = {290--300},
year = {1996},
url = {https://doi.org/10.1137/S0895480194276909},
doi = {10.1137/S0895480194276909},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrownNR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrownCW96,
author = {Jason I. Brown and
Charles J. Colbourn and
David G. Wagner},
title = {Cohen-Macaulay Rings in Network Reliability},
journal = {{SIAM} J. Discret. Math.},
volume = {9},
number = {3},
pages = {377--392},
year = {1996},
url = {https://doi.org/10.1137/S0895480194270780},
doi = {10.1137/S0895480194270780},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrownCW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownW93,
author = {Jason I. Brown and
Stephen Watson},
title = {Mutually complementary partial orders},
journal = {Discret. Math.},
volume = {113},
number = {1-3},
pages = {27--39},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90506-O},
doi = {10.1016/0012-365X(93)90506-O},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BrownCD93,
author = {Jason I. Brown and
Charles J. Colbourn and
John S. Devitt},
title = {Network transformations and bounding network reliability},
journal = {Networks},
volume = {23},
number = {1},
pages = {1--17},
year = {1993},
url = {https://doi.org/10.1002/net.3230230103},
doi = {10.1002/NET.3230230103},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BrownCD93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Brown92,
author = {Jason I. Brown},
title = {A vertex critical graph without critical edges},
journal = {Discret. Math.},
volume = {102},
number = {1},
pages = {99--101},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90354-I},
doi = {10.1016/0012-365X(92)90354-I},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Brown92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrownC92,
author = {Jason I. Brown and
Charles J. Colbourn},
title = {Roots of the Reliability Polynomial},
journal = {{SIAM} J. Discret. Math.},
volume = {5},
number = {4},
pages = {571--585},
year = {1992},
url = {https://doi.org/10.1137/0405047},
doi = {10.1137/0405047},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrownC92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownC91,
author = {Jason I. Brown and
Derek G. Corneil},
title = {Graph properties and hypergraph colourings},
journal = {Discret. Math.},
volume = {98},
number = {2},
pages = {81--93},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90034-Y},
doi = {10.1016/0012-365X(91)90034-Y},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownC91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BrownR91,
author = {Jason I. Brown and
Vojtech R{\"{o}}dl},
title = {A ramsey type problem concerning vertex colourings},
journal = {J. Comb. Theory, Ser. {B}},
volume = {52},
number = {1},
pages = {45--52},
year = {1991},
url = {https://doi.org/10.1016/0095-8956(91)90089-3},
doi = {10.1016/0095-8956(91)90089-3},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BrownR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrownKSW90,
author = {Jason I. Brown and
David Kelly and
Johanan Sch{\"{o}}nheim and
Robert E. Woodrow},
title = {Graph coloring satisfying restraints},
journal = {Discret. Math.},
volume = {80},
number = {2},
pages = {123--143},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90113-V},
doi = {10.1016/0012-365X(90)90113-V},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BrownKSW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrownCM90,
author = {Jason I. Brown and
Derek G. Corneil and
Ali Ridha Mahjoub},
title = {A note on \emph{K\({}_{\mbox{i}}\)}-perfect graphs},
journal = {J. Graph Theory},
volume = {14},
number = {3},
pages = {333--340},
year = {1990},
url = {https://doi.org/10.1002/jgt.3190140306},
doi = {10.1002/JGT.3190140306},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BrownCM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BrownC88,
author = {Jason I. Brown and
Charles J. Colbourn},
title = {A Set System Polynomial with Colouring and Reliability Applications},
journal = {{SIAM} J. Discret. Math.},
volume = {1},
number = {2},
pages = {151--157},
year = {1988},
url = {https://doi.org/10.1137/0401017},
doi = {10.1137/0401017},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BrownC88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrownC87,
author = {Jason I. Brown and
Derek G. Corneil},
title = {On generalized graph colorings},
journal = {J. Graph Theory},
volume = {11},
number = {1},
pages = {87--99},
year = {1987},
url = {https://doi.org/10.1002/jgt.3190110113},
doi = {10.1002/JGT.3190110113},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BrownC87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 02:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
