Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "program-size complexity"
download as .bib file
@article{DBLP:journals/tcs/CannonDDEFPSSW21,
author = {Sarah Cannon and
Erik D. Demaine and
Martin L. Demaine and
Sarah Eisenstat and
David Furcy and
Matthew J. Patitz and
Robert T. Schweller and
Scott M. Summers and
Andrew Winslow},
title = {On the effects of hierarchical self-assembly for reducing program-size
complexity},
journal = {Theor. Comput. Sci.},
volume = {894},
pages = {50--78},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.09.011},
doi = {10.1016/J.TCS.2021.09.011},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CannonDDEFPSSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/eurogp/SamboAKIS20,
author = {Aliyu Sani Sambo and
R. Muhammad Atif Azad and
Yevgeniya Kovalchuk and
Vivek Padmanaabhan Indramohan and
Hanifa Shah},
editor = {Ting Hu and
Nuno Louren{\c{c}}o and
Eric Medvet and
Federico Divina},
title = {Time Control or Size Control? Reducing Complexity and Improving Accuracy
of Genetic Programming Models},
booktitle = {Genetic Programming - 23rd European Conference, EuroGP 2020, Held
as Part of EvoStar 2020, Seville, Spain, April 15-17, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12101},
pages = {195--210},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-44094-7\_13},
doi = {10.1007/978-3-030-44094-7\_13},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/eurogp/SamboAKIS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MeunierRW20,
author = {Pierre{-}{\'{E}}tienne Meunier and
Damien Regnault and
Damien Woods},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {The program-size complexity of self-assembled paths},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {727--737},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384263},
doi = {10.1145/3357713.3384263},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MeunierRW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-04012,
author = {Pierre{-}{\'{E}}tienne Meunier and
Damien Regnault and
Damien Woods},
title = {The program-size complexity of self-assembled paths},
journal = {CoRR},
volume = {abs/2002.04012},
year = {2020},
url = {https://arxiv.org/abs/2002.04012},
eprinttype = {arXiv},
eprint = {2002.04012},
timestamp = {Wed, 12 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-04012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FurcyMS17,
author = {David Furcy and
Samuel Micka and
Scott M. Summers},
title = {Optimal Program-Size Complexity for Self-Assembled Squares at Temperature
1 in 3D},
journal = {Algorithmica},
volume = {77},
number = {4},
pages = {1240--1282},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0147-6},
doi = {10.1007/S00453-016-0147-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FurcyMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pacmpl/AvanziniL17,
author = {Martin Avanzini and
Ugo Dal Lago},
title = {Automating sized-type inference for complexity analysis},
journal = {Proc. {ACM} Program. Lang.},
volume = {1},
number = {{ICFP}},
pages = {43:1--43:29},
year = {2017},
url = {https://doi.org/10.1145/3110287},
doi = {10.1145/3110287},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pacmpl/AvanziniL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toplas/BrockschmidtE0F16,
author = {Marc Brockschmidt and
Fabian Emmes and
Stephan Falke and
Carsten Fuhs and
J{\"{u}}rgen Giesl},
title = {Analyzing Runtime and Size Complexity of Integer Programs},
journal = {{ACM} Trans. Program. Lang. Syst.},
volume = {38},
number = {4},
pages = {13:1--13:50},
year = {2016},
url = {http://dl.acm.org/citation.cfm?id=2866575},
timestamp = {Tue, 03 Jan 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toplas/BrockschmidtE0F16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cie/CaseR16,
author = {John Case and
James S. Royer},
editor = {Arnold Beckmann and
Laurent Bienvenu and
Natasa Jonoska},
title = {Program Size Complexity of Correction Grammars in the Ershov Hierarchy},
booktitle = {Pursuit of the Universal - 12th Conference on Computability in Europe,
CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9709},
pages = {240--250},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-40189-8\_25},
doi = {10.1007/978-3-319-40189-8\_25},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/cie/CaseR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dna/FurcyMS15,
author = {David Furcy and
Samuel Micka and
Scott M. Summers},
editor = {Andrew Phillips and
Peng Yin},
title = {Optimal Program-Size Complexity for Self-Assembly at Temperature 1
in 3D},
booktitle = {{DNA} Computing and Molecular Programming - 21st International Conference,
{DNA} 21, Boston and Cambridge, MA, USA, August 17-21, 2015. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9211},
pages = {71--86},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21999-8\_5},
doi = {10.1007/978-3-319-21999-8\_5},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dna/FurcyMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tacas/BrockschmidtEFFG14,
author = {Marc Brockschmidt and
Fabian Emmes and
Stephan Falke and
Carsten Fuhs and
J{\"{u}}rgen Giesl},
editor = {Erika {\'{A}}brah{\'{a}}m and
Klaus Havelund},
title = {Alternating Runtime and Size Complexity Analysis of Integer Programs},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
- 20th International Conference, {TACAS} 2014, Held as Part of the
European Joint Conferences on Theory and Practice of Software, {ETAPS}
2014, Grenoble, France, April 5-13, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8413},
pages = {140--155},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-642-54862-8\_10},
doi = {10.1007/978-3-642-54862-8\_10},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tacas/BrockschmidtEFFG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FurcyMS14,
author = {David Furcy and
Samuel Micka and
Scott M. Summers},
title = {Optimal program-size complexity for self-assembly at temperature 1
in 3D},
journal = {CoRR},
volume = {abs/1411.1122},
year = {2014},
url = {http://arxiv.org/abs/1411.1122},
eprinttype = {arXiv},
eprint = {1411.1122},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FurcyMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Dinneen12,
author = {Michael J. Dinneen},
editor = {Michael J. Dinneen and
Bakhadyr Khoussainov and
Andr{\'{e}} Nies},
title = {A Program-Size Complexity Measure for Mathematical Problems and Conjectures},
booktitle = {Computation, Physics and Beyond - International Workshop on Theoretical
Computer Science, {WTCS} 2012, Dedicated to Cristian S. Calude on
the Occasion of His 60th Birthday, Auckland, New Zealand, February
21-24, 2012, Revised Selected and Invited Papers},
series = {Lecture Notes in Computer Science},
volume = {7160},
pages = {81--93},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-27654-5\_7},
doi = {10.1007/978-3-642-27654-5\_7},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/birthday/Dinneen12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijuc/JoostenSZ11,
author = {Joost J. Joosten and
Fernando Soler{-}Toscano and
Hector Zenil},
title = {Program-size versus Time Complexity Slowdown and Speed-up Phenomena
in the Micro-cosmos of Small Turing Machines},
journal = {Int. J. Unconv. Comput.},
volume = {7},
number = {5},
pages = {353--387},
year = {2011},
url = {http://www.oldcitypublishing.com/journals/ijuc-home/ijuc-issue-contents/ijuc-volume-7-number-5-2011-2/ijuc-7-5-p-353-387/},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijuc/JoostenSZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-5389,
author = {Joost J. Joosten and
Fernando Soler{-}Toscano and
Hector Zenil},
title = {Program-Size versus Time Complexity, Speed-Up and Slowdown Phenomena
in Small Turing Machines},
journal = {CoRR},
volume = {abs/1102.5389},
year = {2011},
url = {http://arxiv.org/abs/1102.5389},
eprinttype = {arXiv},
eprint = {1102.5389},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-5389.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Reichardt10,
author = {Ben Reichardt},
title = {Least span program witness size equals the general adversary lower
bound on quantum query complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-075}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/075},
eprinttype = {ECCC},
eprint = {TR10-075},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Reichardt10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gecco/PiszczS06b,
author = {Alan Piszcz and
Terence Soule},
editor = {Mike Cattolico},
title = {Genetic programming: optimal population sizes for varying complexity
problems},
booktitle = {Genetic and Evolutionary Computation Conference, {GECCO} 2006, Proceedings,
Seattle, Washington, USA, July 8-12, 2006},
pages = {953--954},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1143997.1144166},
doi = {10.1145/1143997.1144166},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gecco/PiszczS06b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ndjfl/BecherFNP05,
author = {Ver{\'{o}}nica Becher and
Santiago Figueira and
Andr{\'{e}} Nies and
Silvana Picchi},
title = {Program Size Complexity for Possibly Infinite Computations},
journal = {Notre Dame J. Formal Log.},
volume = {46},
number = {1},
pages = {51--64},
year = {2005},
url = {https://doi.org/10.1305/ndjfl/1107220673},
doi = {10.1305/NDJFL/1107220673},
timestamp = {Thu, 21 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ndjfl/BecherFNP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-LG-0212039,
author = {Peter D. Turney},
title = {Low Size-Complexity Inductive Logic Programming: The East-West Challenge
Considered as a Problem in Cost-Sensitive Classification},
journal = {CoRR},
volume = {cs.LG/0212039},
year = {2002},
url = {http://arxiv.org/abs/cs/0212039},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-LG-0212039.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RothemundW00,
author = {Paul W. K. Rothemund and
Erik Winfree},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {The program-size complexity of self-assembled squares (extended abstract)},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {459--468},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335358},
doi = {10.1145/335305.335358},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RothemundW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/CaludeC99,
author = {Cristian Calude and
Richard J. Coles},
editor = {Juhani Karhum{\"{a}}ki and
Hermann A. Maurer and
Gheorghe Paun and
Grzegorz Rozenberg},
title = {Program-Size Complexity of Initial Segments and Domination Reducibility},
booktitle = {Jewels are Forever, Contributions on Theoretical Computer Science
in Honor of Arto Salomaa},
pages = {225--237},
publisher = {Springer},
year = {1999},
timestamp = {Mon, 29 Jul 2002 11:58:34 +0200},
biburl = {https://dblp.org/rec/conf/birthday/CaludeC99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/ChaitinAC95,
author = {Gregory J. Chaitin and
Asat Arslanov and
Cristian Calude},
title = {Program-size Complexity Computes the Halting Problem},
journal = {Bull. {EATCS}},
volume = {57},
year = {1995},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/ChaitinAC95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/YangS93,
author = {En{-}Hui Yang and
Shi{-}Yi Shen},
title = {Distortion program-size complexity with respect to a fidelity criterion
and rate-distortion function},
journal = {{IEEE} Trans. Inf. Theory},
volume = {39},
number = {1},
pages = {288--292},
year = {1993},
url = {https://doi.org/10.1109/18.179376},
doi = {10.1109/18.179376},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/YangS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifip/Maus92,
author = {Arne Maus},
editor = {Jan van Leeuwen},
title = {Entropy as a Complexity Measure, and the Optimal Module Size of Object
Oriented Programs},
booktitle = {Algorithms, Software, Architecture - Information Processing '92, Volume
1, Proceedings of the {IFIP} 12th World Computer Congress, Madrid,
Spain, 7-11 September 1992},
series = {{IFIP} Transactions},
volume = {{A-12}},
pages = {17--23},
publisher = {North-Holland},
year = {1992},
timestamp = {Wed, 14 Aug 2002 08:51:19 +0200},
biburl = {https://dblp.org/rec/conf/ifip/Maus92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asplos/DavidsonV87,
author = {Jack W. Davidson and
Richard A. Vaughan},
editor = {Randy H. Katz and
Martin Freeman},
title = {The Effect of Instruction Set Complexity on Program Size and Memory
Performance},
booktitle = {Proceedings of the Second International Conference on Architectural
Support for Programming Languages and Operating Systems {(ASPLOS}
II), Palo Alto, California, USA, October 5-8, 1987},
pages = {60--64},
publisher = {{ACM} Press},
year = {1987},
url = {https://doi.org/10.1145/36206.36184},
doi = {10.1145/36206.36184},
timestamp = {Wed, 04 May 2022 13:03:26 +0200},
biburl = {https://dblp.org/rec/conf/asplos/DavidsonV87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KatseffS81,
author = {Howard P. Katseff and
Michael Sipser},
title = {Several Results in Program Size Complexity},
journal = {Theor. Comput. Sci.},
volume = {15},
pages = {291--309},
year = {1981},
url = {https://doi.org/10.1016/0304-3975(81)90083-9},
doi = {10.1016/0304-3975(81)90083-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KatseffS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KatseffS77,
author = {Howard P. Katseff and
Michael Sipser},
title = {Several Results in Program Size Complexity},
booktitle = {18th Annual Symposium on Foundations of Computer Science, Providence,
Rhode Island, USA, 31 October - 1 November 1977},
pages = {82--89},
publisher = {{IEEE} Computer Society},
year = {1977},
url = {https://doi.org/10.1109/SFCS.1977.28},
doi = {10.1109/SFCS.1977.28},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KatseffS77.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-04-25 05:34 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:
