Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
13 | Makoto Fujiwara, Tatsuji Kawai |
Equivalence of bar induction and bar recursion for continuous functions with continuous moduli. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 170(8), pp. 867-890, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Sally Hamouda, Stephen H. Edwards, Hicham G. Elmongui, Jeremy V. Ernst, Clifford A. Shaffer |
RecurTutor: An Interactive Tutorial for Learning Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Educ. ![In: ACM Trans. Comput. Educ. 19(1), pp. 1:1-1:25, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Seungsang Oh |
State matrix recursion method and monomer-dimer problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 342(5), pp. 1434-1445, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | John Longley |
Bar recursion is not computable via iteration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. ![In: Comput. 8(2), pp. 119-153, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Thomas Powell 0001 |
Parametrized bar recursion: a unifying framework for realizability interpretations of classical dependent choice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 29(4), pp. 519-554, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Stefano Berardi, Paulo Oliva, Silvia Steila |
An analysis of the Podelski-Rybalchenko termination theorem via bar recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 29(4), pp. 555-575, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Noppasit Chakpitak, Woraphon Yamaka, Paravee Maneejuk |
Predictive Recursion Maximum Likelihood for Kink Regression Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Structural Changes and their Econometric Modeling ![In: Structural Changes and their Econometric Modeling, pp. 572-581, 2019, Springer, 978-3-030-04262-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Kenneth F. Caluya, Abhishek Halder |
Proximal Recursion for Solving the Fokker-Planck Equation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACC ![In: 2019 American Control Conference, ACC 2019, Philadelphia, PA, USA, July 10-12, 2019, pp. 4098-4103, 2019, IEEE, 978-1-5386-7926-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Masayuki Mizuno, Eijiro Sumii |
Formal Verifications of Call-by-Need and Call-by-Name Evaluations with Mutual Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems - 17th Asian Symposium, APLAS 2019, Nusa Dua, Bali, Indonesia, December 1-4, 2019, Proceedings, pp. 181-201, 2019, Springer, 978-3-030-34174-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Kosuke Murata, Kento Emoto |
Recursion Schemes in Coq. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: Programming Languages and Systems - 17th Asian Symposium, APLAS 2019, Nusa Dua, Bali, Indonesia, December 1-4, 2019, Proceedings, pp. 202-221, 2019, Springer, 978-3-030-34174-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Forrest Laine, Claire J. Tomlin |
Parallelizing LQR Computation Through Endpoint-Explicit Riccati Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 58th IEEE Conference on Decision and Control, CDC 2019, Nice, France, December 11-13, 2019, pp. 1395-1402, 2019, IEEE, 978-1-7281-1398-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Abhishek Halder, Tryphon T. Georgiou |
Proximal Recursion for the Wonham Filter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 58th IEEE Conference on Decision and Control, CDC 2019, Nice, France, December 11-13, 2019, pp. 660-665, 2019, IEEE, 978-1-7281-1398-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Olivier Bournez, Arnaud Durand 0001 |
Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany., pp. 23:1-23:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-117-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Pierre Clairambault, Andrzej S. Murawski |
On the Expressivity of Linear Recursion Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany., pp. 50:1-50:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-117-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Nikolay V. Shilov 0002, Danila Danko |
Teaching Efficient Recursive Programming and Recursion Elimination Using Olympiads and Contests Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FISEE ![In: Frontiers in Software Engineering Education - First International Workshop, FISEE 2019, Villebrumier, France, November 11-13, 2019, Invited Papers, pp. 246-264, 2019, Springer, 978-3-030-57662-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Colleen M. Lewis, Daniel D. Garcia, Helen H. Hu, Saber Khan, Nigamanth Sridhar, Bryan Twarek, Chinma Uche |
Microteaching: Recursion, Coding Style, Creative Coding, Inheritance and Polymorphism, Loops, and the Internet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 50th ACM Technical Symposium on Computer Science Education, SIGCSE 2019, Minneapolis, MN, USA, February 27 - March 02, 2019, pp. 962-963, 2019, ACM, 978-1-4503-5890-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Kirshanthan Sundararajah, Milind Kulkarni 0001 |
Composable, sound transformations of nested recursion and loops. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2019, Phoenix, AZ, USA, June 22-26, 2019., pp. 902-917, 2019, ACM, 978-1-4503-6712-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Jerry Swan, Krzysztof Krawiec, Zoltan A. Kocsis |
Stochastic program synthesis via recursion schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (Companion) ![In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, Prague, Czech Republic, July 13-17, 2019., pp. 35-36, 2019, ACM, 978-1-4503-6748-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Paulin Jacobé de Naurois |
Pointers in Recursion: Exploring the Tropics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSCD ![In: 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30, 2019, Dortmund, Germany., pp. 29:1-29:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-107-8. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Niccolò Veltri, Niels van der Weide |
Guarded Recursion in Agda via Sized Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSCD ![In: 4th International Conference on Formal Structures for Computation and Deduction, FSCD 2019, June 24-30, 2019, Dortmund, Germany., pp. 32:1-32:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-107-8. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Philip D. Welch |
Higher Type Recursion for Transfinite Machine Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computing with Foresight and Industry - 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15-19, 2019, Proceedings, pp. 72-83, 2019, Springer, 978-3-030-22995-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
13 | Valentina Urzua, Claudio Gutierrez 0001 |
Linear Recursion in G-CORE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMW ![In: Proceedings of the 13th Alberto Mendelzon International Workshop on Foundations of Data Management, Asunción, Paraguay, June 3-7, 2019., 2019, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
13 | Pierre Clairambault, Charles Grellois, Andrzej S. Murawski |
Linearity in higher-order recursion schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 2(POPL), pp. 39:1-39:29, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Mitchell Wand, Ryan Culpepper, Theophilos Giannakopoulos, Andrew Cobb |
Contextual equivalence for a probabilistic language with continuous random variables and recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 2(ICFP), pp. 87:1-87:30, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Benhui Zhang 0002, Yuan-Sheng Tang |
On the Construction and Analysis of Verifiable Multi-secret Sharing Based on Non-homogeneous Linear Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Inf. Sci. Eng. ![In: J. Inf. Sci. Eng. 34(3), pp. 749-763, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Sebastiaan A. Terwijn |
Generalizations of the Recursion Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 83(4), pp. 1683-1690, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Paulo Oliva, Silvia Steila |
A Direct Proof of Schwichtenberg's Bar Recursion Closure Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Log. ![In: J. Symb. Log. 83(1), pp. 70-83, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Sérgio Mota |
Corrigendum to "The Never Ending Recursion". ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLAP ![In: FLAP 5(8), pp. 1775-1776, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Sandra Carillo, Mauro Lo Schiavo, Cornelia Schiebold |
Recursion operators admitted by non-Abelian Burgers equations: Some remarks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Simul. ![In: Math. Comput. Simul. 147, pp. 40-51, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Fenna Poletiek, Christopher M. Conway, Michelle R. Ellefson, Jun Lai, Bruno R. Bocanegra, Morten H. Christiansen |
Under What Conditions Can Recursion Be Learned? Effects of Starting Small in Artificial Grammar Learning of Center-Embedded Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cogn. Sci. ![In: Cogn. Sci. 42(8), pp. 2855-2889, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Ales Bizjak, Lars Birkedal |
A model of guarded recursion via generalised equilogical spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 722, pp. 1-18, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | John Case, Sanjay Jain 0001, Frank Stephan 0001 |
Effectivity questions for Kleene's recursion theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 733, pp. 55-70, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Hirotaka Niitsuma |
Context-Free Grammars Including Left Recursion using Recursive miniKanren. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computación y Sistemas ![In: Computación y Sistemas 22(4), 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Mariya S. Ushakova, Alexander I. Legalov |
Verification of Programs with Mutual Recursion in Pifagor Language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Autom. Control. Comput. Sci. ![In: Autom. Control. Comput. Sci. 52(7), pp. 850-866, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Forrest Laine, Claire J. Tomlin |
The Parallelization of Riccati Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1809.06360, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Marco T. Morazán |
Vector Programming Using Generative Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TFPIE@TFP ![In: Proceedings Seventh International Workshop on Trends in Functional Programming in Education, TFPIE@TFP 2018, Chalmers University, Gothenburg, Sweden, 14th June 2018., pp. 35-51, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Pawel Parys |
Recursion Schemes, the MSO Logic, and the U quantifier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1810.04763, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Olivier Bournez, Arnaud Durand 0001, Sabrina Ouazzani |
Recursion schemes, discrete differential equations and characterization of polynomial time computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1810.02241, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | John Longley |
Bar recursion is not computable via iteration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.07277, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Valentin Blot |
An interpretation of system F through bar recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1804.00731, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Sebastiaan A. Terwijn |
Generalizations of the Recursion Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.10843, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl |
Expansion-Based QBF Solving Without Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.08964, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Eunji Jeong, Joo Seong Jeong, Soojeong Kim, Gyeong-In Yu, Byung-Gon Chun |
Improving the Expressiveness of Deep Learning Frameworks with Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1809.00832, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Adrien Guatto |
A Generalized Modality for Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.11021, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Mitchell Wand, Ryan Culpepper, Theophilos Giannakopoulos, Andrew Cobb |
Contextual Equivalence for a Probabilistic Language with Continuous Random Variables and Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.02809, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Paula Severi |
Two Light Modalities for Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1801.00285, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Carmen Lacave, Ana I. Molina, Miguel A. Redondo |
A Preliminary Instrument for Measuring Students' Subjective Perceptions of Difficulties in Learning Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Educ. ![In: IEEE Trans. Educ. 61(2), pp. 119-126, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | John Longley |
The recursion hierarchy for PCF is strict. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 14(3), 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Sergey Goncharov 0001, Lutz Schröder, Christoph Rauch, Julian Jakob |
Unguarded Recursion on Coinductive Resumptions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 14(3), 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Adam D. Barwell, Christopher Brown 0002, Kevin Hammond |
Finding parallel functional pearls: Automatic parallel recursion scheme detection in Haskell functions via anti-unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Future Gener. Comput. Syst. ![In: Future Gener. Comput. Syst. 79, pp. 669-686, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Norman Do, Paul T. Norbury |
Topological recursion for irregular spectral curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Lond. Math. Soc. ![In: J. Lond. Math. Soc. 97(3), pp. 398-426, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Xiaodong Meng, Minyi Guo, Jingyu Zhang |
An Efficient Graph Query Framework with Structural Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 61(1), pp. 144-157, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Daniel Lokshtanov, M. S. Ramanujan 0001, Saket Saurabh 0001 |
When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 1916-1933, 2018, SIAM, 978-1-61197-503-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Adrien Guatto |
A Generalized Modality for Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2018, Oxford, UK, July 09-12, 2018, pp. 482-491, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Tom Verhoeff |
A Master Class on Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adventures Between Lower Bounds and Higher Altitudes ![In: Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, pp. 610-633, 2018, Springer, 978-3-319-98354-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Maikel Leemans, Wil M. P. van der Aalst, Mark G. J. van den Brand |
Recursion aware modeling and discovery for hierarchical software event log analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SANER ![In: 25th International Conference on Software Analysis, Evolution and Reengineering, SANER 2018, Campobasso, Italy, March 20-23, 2018, pp. 185-196, 2018, IEEE Computer Society, 978-1-5386-4969-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Xiaoxia Zheng, Haomiao Yang, Bin Tang |
An Improved Characters Recognition Approach Using Fast Determinant Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MASS ![In: 15th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2018, Chengdu, China, October 9-12, 2018, pp. 491-494, 2018, IEEE Computer Society, 978-1-5386-5580-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Roman R. Redziejowski |
More about Left Recursion in PEG. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CS&P ![In: Proceedings of the 27th International Workshop on Concurrency, Specification and Programming, Berlin, Germany, September 24-26, 2018., 2018, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
13 | Ramy Esteero, Mohammed Khan, Mohamed Mohamed 0003, Larry Yueli Zhang, Daniel Zingaro |
Recursion or Iteration: Does it Matter What Students Choose? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 49th ACM Technical Symposium on Computer Science Education, SIGCSE 2018, Baltimore, MD, USA, February 21-24, 2018, pp. 1011-1016, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Preston Tunnell Wilson, Kathi Fisler, Shriram Krishnamurthi |
Evaluating the Tracing of Recursion in the Substitution Notional Machine. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE ![In: Proceedings of the 49th ACM Technical Symposium on Computer Science Education, SIGCSE 2018, Baltimore, MD, USA, February 21-24, 2018, pp. 1023-1028, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Paul M. Roberts |
Directed Recursion Search: A Directed DFS for Online Pathfinding in Random Grid-Based Environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SGAI Conf. ![In: Artificial Intelligence XXXV - 38th SGAI International Conference on Artificial Intelligence, AI 2018, Cambridge, UK, December 11-13, 2018, Proceedings, pp. 165-170, 2018, Springer, 978-3-030-04190-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Daniel Della-Bosca |
Recursion and the augmented experience of public art. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSW ![In: Proceedings of the Australasian Computer Science Week Multiconference, ACSW 2018, Brisbane, QLD, Australia, January 29 - February 02, 2018, pp. 45:1-45:6, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Pawel Parys |
Recursion Schemes and the WMSO+U Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 53:1-53:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Celine Latulipe, Berto Gonzalez, Melissa Word, Sybil Huskey, David C. Wilson |
Moderate Recursion: A Digital Artifact of Interactive Dance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ArtsIT/DLI ![In: Interactivity, Game Creation, Design, Learning, and Innovation - 7th EAI International Conference, ArtsIT 2018, and 3rd EAI International Conference, DLI 2018, ICTCC 2018, Braga, Portugal, October 24-26, 2018, Proceedings, pp. 48-57, 2018, Springer, 978-3-030-06133-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Jonas Kaiser, Steven Schäfer, Kathrin Stark |
Binder aware recursion over well-scoped de Bruijn syntax. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPP ![In: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2018, Los Angeles, CA, USA, January 8-9, 2018, pp. 293-306, 2018, ACM, 978-1-4503-5586-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl |
Expansion-Based QBF Solving Without Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FMCAD ![In: 2018 Formal Methods in Computer Aided Design, FMCAD 2018, Austin, TX, USA, October 30 - November 2, 2018, pp. 1-10, 2018, IEEE, 978-0-9835678-8-2. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Anupam Das 0002, Isabel Oitavem |
A Recursion-Theoretic Characterisation of the Positive Polynomial-Time Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 27th EACSL Annual Conference on Computer Science Logic, CSL 2018, September 4-7, 2018, Birmingham, UK, pp. 18:1-18:17, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-088-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Eunji Jeong, Joo Seong Jeong, Soojeong Kim, Gyeong-In Yu, Byung-Gon Chun |
Improving the expressiveness of deep learning frameworks with recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroSys ![In: Proceedings of the Thirteenth EuroSys Conference, EuroSys 2018, Porto, Portugal, April 23-26, 2018, pp. 19:1-19:13, 2018, ACM. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
13 | Cory M. Knapp |
Partial functions and recursion in univalent type theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2018 |
RDF |
|
13 | Seokhyun Yoon |
Convergence and Density Evolution of a MIMO Detector Based on a Forward-Backward Recursion Over a Ring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Veh. Technol. ![In: IEEE Trans. Veh. Technol. 66(8), pp. 6764-6774, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Stefan Milius, Tadeusz Litak |
Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 150(3-4), pp. 407-449, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Robin Kaarsgaard, Holger Bock Axelsen, Robert Glück |
Join inverse categories and reversible recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Algebraic Methods Program. ![In: J. Log. Algebraic Methods Program. 87, pp. 33-50, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre |
Collapsible Pushdown Automata and Recursion Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 18(3), pp. 25:1-25:42, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Simon Thompson |
A General Method for Defining Objects by Recursion over Syntax. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Univers. Comput. Sci. ![In: J. Univers. Comput. Sci. 23(1), pp. 89-111, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | Adrian Francalanza, Luca Aceto, Anna Ingólfsdóttir |
Monitorability for the Hennessy-Milner logic with recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 51(1), pp. 87-116, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Vassilios Gregoriades |
A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo-Fraenkel set theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Log. Q. ![In: Math. Log. Q. 63(6), pp. 544-551, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Sekson Sirisubtawee, Supaporn Kaewta |
New Modified Adomian Decomposition Recursion Schemes for Solving Certain Types of Nonlinear Fractional Two-Point Boundary Value Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Math. Math. Sci. ![In: Int. J. Math. Math. Sci. 2017, pp. 5742965:1-5742965:20, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Ying-Hua Ji, Ju-Ju Hu |
Application of the recursion-transform method in calculating the equivalent resistance of two-dimensional finite resistor network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Circuit Theory Appl. ![In: Int. J. Circuit Theory Appl. 45(6), pp. 764-773, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Thom W. Frühwirth |
A Devil's Advocate against Termination of Direct Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1701.02682, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | Marco T. Morazán |
Vector Programming Using Structural Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TFPIE@TFP ![In: Proceedings Sixth Workshop on Trends in Functional Programming in Education, TFPIE@TFP 2017, Canterbury, Kent UK, 22 June 2017., pp. 1-17, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Maikel Leemans, Wil M. P. van der Aalst, Mark G. J. van den Brand |
Recursion Aware Modeling and Discovery For Hierarchical Software Event Log Analysis (Extended). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1710.09323, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | William Blum |
Type homogeneity is not a restriction for safe recursion schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1701.02118, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | Seyed Mehran Kazemi, Angelika Kimmig, Guy Van den Broeck, David Poole 0001 |
Domain Recursion for Lifted Inference with Existential Quantifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1707.07763, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | Jonathon Cai, Richard Shin, Dawn Song |
Making Neural Programming Architectures Generalize via Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.06611, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | Daniel Liu, Lvette Lopez |
A computer-based recursion algorithm for automatic charge of power device of electric vehicles carrying electromagnet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1706.08177, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | G. A. Kavvos |
On the Semantics of Intensionality and Intensional Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1712.09302, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | G. A. Kavvos |
Intensionality, Intensional Recursion, and the Gödel-Löb axiom. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1703.01288, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | Rob J. van Glabbeek |
Lean and Full Congruence Formats for Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.03160, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | Rob J. van Glabbeek |
An Algebraic Treatment of Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.07838, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | Matthias Hauswirth |
If you have parents, you can learn recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. EATCS ![In: Bull. EATCS 123, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | Nicolae Anghel |
On a 2015 Putnam Problem Related to a Double Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Am. Math. Mon. ![In: Am. Math. Mon. 124(1), pp. 60-69, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
13 | Alexandros Agapitos, Michael O'Neill 0001, Ahmed Kattan, Simon M. Lucas |
Recursion in tree-based genetic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Genet. Program. Evolvable Mach. ![In: Genet. Program. Evolvable Mach. 18(2), pp. 149-183, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Sérgio Mota |
The never-ending recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Log. ![In: J. Appl. Log. 25, pp. 89-108, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Paulo Oliva, Thomas Powell 0001 |
Bar recursion over finite partial functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 168(5), pp. 887-921, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Luke Nelson |
A recursion on maximal chains in the Tamari lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 340(4), pp. 661-677, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Luca Reggiani, Laura Dossi |
Computation of information rates by means of discrete states density recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Phys. Commun. ![In: Phys. Commun. 23, pp. 37-42, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Joaquín Díaz-Boïls |
Categorical comprehensions and recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 27(5), pp. 1607-1641, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Sally Hamouda, Stephen H. Edwards, Hicham G. Elmongui, Jeremy V. Ernst, Clifford A. Shaffer |
A basic recursion concept inventory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Sci. Educ. ![In: Comput. Sci. Educ. 27(2), pp. 121-148, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Pathairat Pastpipatkul, Woraphon Yamaka, Songsak Sriboonchitta |
Predictive Recursion Maximum Likelihood of Threshold Autoregressive Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Robustness in Econometrics ![In: Robustness in Econometrics, pp. 349-362, 2017, 978-3-319-50741-5. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
13 | Peter G. Hinman |
Recursion-Theoretic Hierarchies ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2017 |
DOI RDF |
|