Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: George S. Lueker
@article{DBLP:journals/jacm/Lueker09,
author = {George S. Lueker},
title = {Improved bounds on the average length of longest common subsequences},
journal = {J. {ACM}},
volume = {56},
number = {3},
pages = {17:1--17:38},
year = {2009},
url = {https://doi.org/10.1145/1516512.1516519},
doi = {10.1145/1516512.1516519},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Lueker09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DuEGL09,
author = {Wenliang Du and
David Eppstein and
Michael T. Goodrich and
George S. Lueker},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {On the Approximability of Geometric and Geographic Generalization
and the Min-Max Bin Covering Problem},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {242--253},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_22},
doi = {10.1007/978-3-642-03367-4\_22},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/DuEGL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-3756,
author = {Wenliang Du and
David Eppstein and
Michael T. Goodrich and
George S. Lueker},
title = {On the Approximability of Geometric and Geographic Generalization
and the Min-Max Bin Covering Problem},
journal = {CoRR},
volume = {abs/0904.3756},
year = {2009},
url = {http://arxiv.org/abs/0904.3756},
eprinttype = {arXiv},
eprint = {0904.3756},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-3756.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Lueker08,
author = {George S. Lueker},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {On the Convergence of Upper Bound Techniques for the Average Length
of Longest Common Subsequences},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {169--182},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.1},
doi = {10.1137/1.9781611972986.1},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/Lueker08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/CoffmanL06,
author = {Edward G. Coffman Jr. and
George S. Lueker},
title = {Approximation Algorithms for Extensible Bin Packing},
journal = {J. Sched.},
volume = {9},
number = {1},
pages = {63--69},
year = {2006},
url = {https://doi.org/10.1007/s10951-006-5594-5},
doi = {10.1007/S10951-006-5594-5},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/CoffmanL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gd/GoodrichLS05,
author = {Michael T. Goodrich and
George S. Lueker and
Jonathan Z. Sun},
editor = {Patrick Healy and
Nikola S. Nikolov},
title = {C-Planarity of Extrovert Clustered Graphs},
booktitle = {Graph Drawing, 13th International Symposium, {GD} 2005, Limerick,
Ireland, September 12-14, 2005, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3843},
pages = {211--222},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11618058\_20},
doi = {10.1007/11618058\_20},
timestamp = {Sun, 13 Nov 2022 09:57:32 +0100},
biburl = {https://dblp.org/rec/conf/gd/GoodrichLS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Lueker03,
author = {George S. Lueker},
title = {Improved bounds on the average length of longest common subsequences},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {130--131},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644132},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Lueker03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EppsteinL02,
author = {David Eppstein and
George S. Lueker},
title = {The minimum expectation selection problem},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {278--292},
year = {2002},
url = {https://doi.org/10.1002/rsa.10061},
doi = {10.1002/RSA.10061},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EppsteinL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CoffmanL01,
author = {Edward G. Coffman Jr. and
George S. Lueker},
editor = {S. Rao Kosaraju},
title = {Approximation algorithms for extensible bin packing},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {586--588},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365541},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CoffmanL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DS-0110011,
author = {David Eppstein and
George S. Lueker},
title = {The Minimum Expectation Selection Problem},
journal = {CoRR},
volume = {cs.DS/0110011},
year = {2001},
url = {https://arxiv.org/abs/cs/0110011},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DS-0110011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CoffmanLSW00,
author = {Edward G. Coffman Jr. and
George S. Lueker and
Joel Spencer and
Peter M. Winkler},
editor = {Gaston H. Gonnet and
Daniel Panario and
Alfredo Viola},
title = {Average-Case Analysis of Retangle Packings},
booktitle = {{LATIN} 2000: Theoretical Informatics, 4th Latin American Symposium,
Punta del Este, Uruguay, April 10-14, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1776},
pages = {292--297},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/10719839\_30},
doi = {10.1007/10719839\_30},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/CoffmanLSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Lueker98,
author = {George S. Lueker},
title = {Average-Case Analysis of Off-Line and On-Line Knapsack Problems},
journal = {J. Algorithms},
volume = {29},
number = {2},
pages = {277--305},
year = {1998},
url = {https://doi.org/10.1006/jagm.1998.0954},
doi = {10.1006/JAGM.1998.0954},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Lueker98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Lueker98,
author = {George S. Lueker},
title = {Exponentially small bounds on the expected optimum of the partition
and subset sum problems},
journal = {Random Struct. Algorithms},
volume = {12},
number = {1},
pages = {51--62},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1098-2418(199801)12:1\&\#60;51::AID-RSA3\&\#62;3.0.CO;2-S},
doi = {10.1002/(SICI)1098-2418(199801)12:1\&\#60;51::AID-RSA3\&\#62;3.0.CO;2-S},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Lueker98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Lueker95,
author = {George S. Lueker},
editor = {Kenneth L. Clarkson},
title = {Average-Case Analysis of Off-Line and On-Line Knapsack Problems},
booktitle = {Proceedings of the Sixth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1995. San Francisco, California, {USA}},
pages = {179--188},
publisher = {{ACM/SIAM}},
year = {1995},
url = {http://dl.acm.org/citation.cfm?id=313651.313692},
timestamp = {Thu, 05 Jul 2018 07:29:25 +0200},
biburl = {https://dblp.org/rec/conf/soda/Lueker95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/LuekerM93,
author = {George S. Lueker and
Mariko Molodowitch},
title = {More analysis of double hashing},
journal = {Comb.},
volume = {13},
number = {1},
pages = {83--96},
year = {1993},
url = {https://doi.org/10.1007/BF01202791},
doi = {10.1007/BF01202791},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/LuekerM93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0070175,
author = {Edward G. Coffman Jr. and
George S. Lueker},
title = {Probabilistic analysis of packing and partitioning algorithms},
series = {Wiley-Interscience series in discrete mathematics and optimization},
publisher = {Wiley},
year = {1991},
isbn = {978-0-471-53272-9},
timestamp = {Tue, 19 Apr 2011 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0070175.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LuekerMR90,
author = {George S. Lueker and
Nimrod Megiddo and
Vijaya Ramachandran},
title = {Linear Programming with Two Variables per Inequality in Poly-Log Time},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {6},
pages = {1000--1010},
year = {1990},
url = {https://doi.org/10.1137/0219068},
doi = {10.1137/0219068},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/LuekerMR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LuekerM88,
author = {George S. Lueker and
Mariko Molodowitch},
editor = {Janos Simon},
title = {More Analysis of Double Hashing},
booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
May 2-4, 1988, Chicago, Illinois, {USA}},
pages = {354--359},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/62212.62246},
doi = {10.1145/62212.62246},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LuekerM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LuekerMR86,
author = {George S. Lueker and
Nimrod Megiddo and
Vijaya Ramachandran},
editor = {Juris Hartmanis},
title = {Linear Programming with Two Variables per Inequality in Poly-Log Time
(Preliminary Version)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {196--205},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12150},
doi = {10.1145/12130.12150},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LuekerMR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/WillardL85,
author = {Dan E. Willard and
George S. Lueker},
title = {Adding Range Restriction Capability to Dynamic Data Structures},
journal = {J. {ACM}},
volume = {32},
number = {3},
pages = {597--617},
year = {1985},
url = {https://doi.org/10.1145/3828.3839},
doi = {10.1145/3828.3839},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/WillardL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/CoffmanFL84,
author = {Edward G. Coffman Jr. and
Greg N. Frederickson and
George S. Lueker},
title = {A Note on Expected Makespans for Largest-First Sequences of Independent
Tasks on Two Processors},
journal = {Math. Oper. Res.},
volume = {9},
number = {2},
pages = {260--266},
year = {1984},
url = {https://doi.org/10.1287/moor.9.2.260},
doi = {10.1287/MOOR.9.2.260},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/CoffmanFL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/performance/CoffmanFL84,
author = {Edward G. Coffman Jr. and
Leopold Flatto and
George S. Lueker},
editor = {Erol Gelenbe},
title = {Expected Makespans for Largest-First Multiprocessor Scheduling},
booktitle = {Performance '84, Proceedings of the Tenth International Symposium
on Computer Performance Modelling, Measurement and Evaluation, Paris,
France, 19-21 December, 1984},
pages = {491--506},
publisher = {North-Holland},
year = {1984},
timestamp = {Tue, 30 Apr 2002 11:18:02 +0200},
biburl = {https://dblp.org/rec/conf/performance/CoffmanFL84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lueker83,
author = {George S. Lueker},
title = {Bin Packing with Items Uniformly Distributed over Intervals [a,b]},
booktitle = {24th Annual Symposium on Foundations of Computer Science, Tucson,
Arizona, USA, 7-9 November 1983},
pages = {289--297},
publisher = {{IEEE} Computer Society},
year = {1983},
url = {https://doi.org/10.1109/SFCS.1983.9},
doi = {10.1109/SFCS.1983.9},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lueker83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LuekerW82,
author = {George S. Lueker and
Dan E. Willard},
title = {A Data Structure for Dynamic Range Queries},
journal = {Inf. Process. Lett.},
volume = {15},
number = {5},
pages = {209--213},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90119-3},
doi = {10.1016/0020-0190(82)90119-3},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/LuekerW82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/VegaL81,
author = {Wenceslas Fernandez de la Vega and
George S. Lueker},
title = {Bin packing can be solved within 1+epsilon in linear time},
journal = {Comb.},
volume = {1},
number = {4},
pages = {349--355},
year = {1981},
url = {https://doi.org/10.1007/BF02579456},
doi = {10.1007/BF02579456},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/VegaL81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/Lueker81,
author = {George S. Lueker},
title = {Surveyor's Forum: Generating Solutions},
journal = {{ACM} Comput. Surv.},
volume = {13},
number = {3},
pages = {370},
year = {1981},
url = {https://doi.org/10.1145/356850.356858},
doi = {10.1145/356850.356858},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/Lueker81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Lueker81,
author = {George S. Lueker},
title = {Optimization Problems on Graphs with Independent Random Edge Weights},
journal = {{SIAM} J. Comput.},
volume = {10},
number = {2},
pages = {338--351},
year = {1981},
url = {https://doi.org/10.1137/0210024},
doi = {10.1137/0210024},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Lueker81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acm/LuekerR81,
author = {George S. Lueker and
Edward L. Robertson},
editor = {Toni Shelter and
Steven Abraham and
Emily P. Friedman and
Beth Levy},
title = {That really is a hard problem you've spent six months working on:
{A} tutorial on NP-complete problems},
booktitle = {Proceedings of the {ACM} 1981 Annual Conference, Los Angeles, CA,
USA, November 9-11, 1981},
pages = {293--294},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800175.809904},
doi = {10.1145/800175.809904},
timestamp = {Tue, 06 Nov 2018 16:58:26 +0100},
biburl = {https://dblp.org/rec/conf/acm/LuekerR81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csur/Lueker80,
author = {George S. Lueker},
title = {Some Techniques for Solving Recurrences},
journal = {{ACM} Comput. Surv.},
volume = {12},
number = {4},
pages = {419--436},
year = {1980},
url = {https://doi.org/10.1145/356827.356832},
doi = {10.1145/356827.356832},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csur/Lueker80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LuekerB79,
author = {George S. Lueker and
Kellogg S. Booth},
title = {A Linear Time Algorithm for Deciding Interval Graph Isomorphism},
journal = {J. {ACM}},
volume = {26},
number = {2},
pages = {183--195},
year = {1979},
url = {https://doi.org/10.1145/322123.322125},
doi = {10.1145/322123.322125},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LuekerB79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lueker78,
author = {George S. Lueker},
title = {A Data Structure for Orthogonal Range Queries},
booktitle = {19th Annual Symposium on Foundations of Computer Science, Ann Arbor,
Michigan, USA, 16-18 October 1978},
pages = {28--34},
publisher = {{IEEE} Computer Society},
year = {1978},
url = {https://doi.org/10.1109/SFCS.1978.1},
doi = {10.1109/SFCS.1978.1},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lueker78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Lueker78,
author = {George S. Lueker},
editor = {Richard J. Lipton and
Walter A. Burkhard and
Walter J. Savitch and
Emily P. Friedman and
Alfred V. Aho},
title = {Maximization Problems on Graphs with Edge Weights Chosen from a Normal
Distribution (Extended Abstract)},
booktitle = {Proceedings of the 10th Annual {ACM} Symposium on Theory of Computing,
May 1-3, 1978, San Diego, California, {USA}},
pages = {13--18},
publisher = {{ACM}},
year = {1978},
url = {https://doi.org/10.1145/800133.804327},
doi = {10.1145/800133.804327},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Lueker78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BoothL76,
author = {Kellogg S. Booth and
George S. Lueker},
title = {Testing for the Consecutive Ones Property, Interval Graphs, and Graph
Planarity Using PQ-Tree Algorithms},
journal = {J. Comput. Syst. Sci.},
volume = {13},
number = {3},
pages = {335--379},
year = {1976},
url = {https://doi.org/10.1016/S0022-0000(76)80045-1},
doi = {10.1016/S0022-0000(76)80045-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BoothL76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/RoseTL76,
author = {Donald J. Rose and
Robert Endre Tarjan and
George S. Lueker},
title = {Algorithmic Aspects of Vertex Elimination on Graphs},
journal = {{SIAM} J. Comput.},
volume = {5},
number = {2},
pages = {266--283},
year = {1976},
url = {https://doi.org/10.1137/0205021},
doi = {10.1137/0205021},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/RoseTL76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BoothL75,
author = {Kellogg S. Booth and
George S. Lueker},
editor = {William C. Rounds and
Nancy Martin and
Jack W. Carlyle and
Michael A. Harrison},
title = {Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive
Ones Property},
booktitle = {Proceedings of the 7th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1975, Albuquerque, New Mexico, {USA}},
pages = {255--265},
publisher = {{ACM}},
year = {1975},
url = {https://doi.org/10.1145/800116.803776},
doi = {10.1145/800116.803776},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BoothL75.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 01:41 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:
