|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1424 occurrences of 808 keywords
|
|
|
Results
Found 2517 publication records. Showing 2517 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
14 | Johann Eder |
Extending SQL with General Transitive Closure and Extreme Value Selections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 2(4), pp. 381-390, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
general transitive closure, recursive query processing applications, general recursive capabilities, existing query languages, database language SQL, view definition mechanism, extreme value sections, special constructs, maximal values, recursively defined views, nonlinear recursion, standards, database management systems, query languages, attributes, information retrieval systems, tuples, recursive structures |
14 | Mark A. Fulk |
Robust Separations in Inductive Inference ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 405-410, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
recursion-theoretic inductive inference, function learning, formal language |
14 | Stephen A. Cook, Bruce M. Kapron |
Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 154-159, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
finite type functional, simple typed while-programming language, mu -recursion, feasible functionals, length-bounded, bounded typed loop program, run times |
14 | Rob J. van Glabbeek |
Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings, pp. 336-347, 1987, Springer, 3-540-17219-X. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
& Phrases Concurrency, Approximation Induction Principle, Bounded Nondeterminism, Fairness, Abstraction, Consistency, Process algebra, Recursion, Bisimulation, Liveness, ACP |
14 | Eric C. R. Hehner |
Structuring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, pp. 201-205, 1977, ACM. The full citation details ...](Pics/full.jpeg) |
1977 |
DBLP DOI BibTeX RDF |
data structures, recursion, language design, control structures |
14 | William W. Hooker |
On the expected lengths of sequences generated in sorting by replacement selecting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 12(7), pp. 411-413, 1969. The full citation details ...](Pics/full.jpeg) |
1969 |
DBLP DOI BibTeX RDF |
asymptotic expected length, meromorphic function, recursion relation, replacement selecting, sequence lengths, sorting, generating function |
13 | Maximilien Mackie |
Recursion-free modular arithmetic in the lambda-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 183, pp. 106408, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Kip Errett Patterson |
TOTEs and trauma: a cybernetic, extended recursion schematic for hyper vigilance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Kybernetes ![In: Kybernetes 53(3), pp. 867-881, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Weiwei Chen, Yuhang Ji, Ziyang Qi, Liping Yan, Xiang Zhao |
Automatic Determination of Set of Multivariate Basis Polynomials Based on Recursion and Application of LSPCR to High-Dimensional Uncertainty Quantification of Multi-Conductor Transmission Lines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 12, pp. 18536-18544, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Linnea Persson, Anders Hansson, Bo Wahlberg |
An optimization algorithm based on forward recursion with applications to variable horizon MPC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Control ![In: Eur. J. Control 75, pp. 100900, January 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Yue Niu, Jonathan Sterling, Robert Harper 0001 |
Cost-sensitive computational adequacy of higher-order recursion in synthetic domain theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2404.00212, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Stacey Jeffery, Galina Pass |
Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.08355, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Matthias Gerstgrasser, Rylan Schaeffer, Apratim Dey, Rafael Rafailov, Henry Sleight, John Hughes, Tomasz Korbak, Rajashree Agrawal, Dhruv Pai, Andrey Gromov, Daniel A. Roberts, Diyi Yang, David L. Donoho, Sanmi Koyejo |
Is Model Collapse Inevitable? Breaking the Curse of Recursion by Accumulating Real and Synthetic Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2404.01413, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Matheus Campos Fernandes, Fabrício Olivetti de França, Emilio Francesquini |
Origami: (un)folding the abstraction of recursion schemes for program synthesis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.13828, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Shizhuo Dylan Zhang, Curt Tigges, Zory Zhang, Stella Biderman, Maxim Raginsky, Talia Ringer |
Transformer-Based Models Are Not Yet Perfect At Learning to Emulate Structural Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.12947, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Seth Bernstein, Paul Denny 0001, Juho Leinonen 0001, Lauren Kan, Arto Hellas, Matt Littlefield, Sami Sarsa, Stephen MacNeil |
"Like a Nesting Doll": Analyzing Recursion Analogies Generated by CS Students using Large Language Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.09409, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler |
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Database Syst. ![In: ACM Trans. Database Syst. 49(1), pp. 1:1-1:43, March 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Florian Plötzky, Niklas Kiehne, Wolf-Tilo Balke |
Lost in Recursion: Mining Rich Event Semantics in Knowledge Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WebSci ![In: Proceedings of the 16th ACM Web Science Conference, WEBSCI 2024, Stuttgart, Germany, May 21-24, 2024, pp. 354-364, 2024, ACM. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Sverrir Thorgeirsson, Lennart C. Lais, Theo B. Weidmann, Zhendong Su 0001 |
Recursion in Secondary Computer Science Education: A Comparative Study of Visual Programming Approaches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE (1) ![In: Proceedings of the 55th ACM Technical Symposium on Computer Science Education, SIGCSE 2024, Volume 1, Portland, OR, USA, March 20-23, 2024, pp. 1321-1327, 2024, ACM. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Joseph Eremondi |
Strictly Monotone Brouwer Trees for Well Founded Recursion over Multiple Arguments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPP ![In: Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2024, London, UK, January 15-16, 2024, pp. 205-217, 2024, ACM. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
13 | Pedro Abreu, Benjamin Delaware, Alex Hubers, Christa Jenkins, J. Garrett Morris, Aaron Stump |
A Type-Based Approach to Divide-and-Conquer Recursion in Coq. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 7(POPL), pp. 61-90, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Daan Leijen, Anton Lorenzen |
Tail Recursion Modulo Context: An Equational Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 7(POPL), pp. 1152-1181, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Levon Aslanyan, Karen Gishyan, Hasmik Sahakyan |
Target Class Classification Recursion Preliminaries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Balt. J. Mod. Comput. ![In: Balt. J. Mod. Comput. 11(3), 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Andong Fan, Lionel Parreaux |
super-Charging Object-Oriented Programming Through Precise Typing of Open Recursion (Artifact). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Dagstuhl Artifacts Ser. ![In: Dagstuhl Artifacts Ser. 9(2), pp. 22:1-22:2, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Zhengkang Zuo, Zhicheng Zeng, Wei Su, Qing Huang, Yuhan Ke, Zengxin Liu, Changjing Wang, Wei Liang |
Specification transformation method for functional program generation based on partition-recursion refinement rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Sci. ![In: Inf. Sci. 633, pp. 613-632, July 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Kang Sun, Manyun Huang, Zhinong Wei, Jingtao Zhao, Guoqiang Sun |
A Real-Time Recursion Correction Hybrid Linear State Estimator Using Stream Processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Ind. Informatics ![In: IEEE Trans. Ind. Informatics 19(3), pp. 2317-2329, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Sakyo Hashimoto, Keigo Takeuchi |
Simplification and Accurate Implementation of State Evolution Recursion for Conjugate Gradient. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(6), pp. 952-956, June 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Dongzhou Huang |
On a modified version of the Lindley recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Queueing Syst. Theory Appl. ![In: Queueing Syst. Theory Appl. 105(3), pp. 271-289, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Atri Rudra |
Technical Perspective: (Pre-) Semirings Come to the Recursion Party. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Rec. ![In: SIGMOD Rec. 52(1), pp. 74, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Rémi Lacombe, Sébastien Gros, Nikolce Murgovski, Balázs Kulcsár |
Distributed Eco-Driving Control of a Platoon of Electric Vehicles Through Riccati Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Intell. Transp. Syst. ![In: IEEE Trans. Intell. Transp. Syst. 24(3), pp. 3048-3063, March 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Derek Levinson |
John Steel and Hugh Woodin. HOD as a Core Model. Ordinal Definability and Recursion Theory: The Cabal Seminar, Volume III, edited by Alexander Kechris, Benedikt Lowe, and John Steel, Lecture Notes in Logic, vol. 3, Cambridge University Press, Cambridge, pp. 257-345. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. Symb. Log. ![In: Bull. Symb. Log. 29(4), pp. 656-657, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Weinan Zhang 0004, Pingping Zeng, Yue Kuen Kwok |
Efficient recursion-quadrature algorithms for pricing Asian options and variance derivatives under stochastic volatility and Lévy jumps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 51(6), pp. 687-694, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Lin Li, Rui Li, Yajun Ha |
A Recursion and Lock Free GPU-Based Logic Rewriting Framework Exploiting Both Intranode and Internode Parallelism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(11), pp. 3972-3984, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Tomoyuki Yamakami |
Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.15884, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus |
Simulating Logspace-Recursion with Logarithmic Quantifier Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.12948, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Ilia Shumailov, Zakhar Shumaylov, Yiren Zhao, Yarin Gal, Nicolas Papernot, Ross J. Anderson |
The Curse of Recursion: Training on Generated Data Makes Models Forget. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.17493, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Thom W. Frühwirth |
Runtime Repeated Recursion Unfolding: A Just-In-Time Online Program Optimization That Can Achieve Super-Linear Speedup. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.02180, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Maksymilian Dabkowski, Gasper Begus |
Large language models and (non-)linguistic recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.07195, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Anna Ingólfsdóttir |
Complexity results for modal logic with recursion via translations and tableaux. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.16881, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Joseph Eremondi |
Strictly Monotone Brouwer Trees for Well-founded Recursion Over Multiple Arguments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.06962, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Jishnu Ray Chowdhury, Cornelia Caragea |
Efficient Beam Tree Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.10779, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Soochan Lee, Gunhee Kim |
Recursion of Thought: A Divide-and-Conquer Approach to Multi-Context Reasoning with Language Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.06891, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Joachim Tilsted Kristensen, Robin Kaarsgaard, Michael Kirkedal Thomsen |
Tail recursion transformation for invertible functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.10049, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Joao Victor de Souza, Victor H. R. Nogueira, Alessandro S. Nascimento |
Ligand binding free energy evaluation by Monte Carlo Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Biol. Chem. ![In: Comput. Biol. Chem. 103, pp. 107830, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Shlomo Engelberg |
Implementing Moving Average Filters Using Recursion [Tips & Tricks]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Signal Process. Mag. ![In: IEEE Signal Process. Mag. 40(7), pp. 78-80, November 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Patrick Uftring |
Weak and strong versions of Effective Transfinite Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 174(4), pp. 103232, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Sai Deng, Bo Du |
zkTree: a zk recursion tree with ZKP membership proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2023, pp. 208, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
13 | Andrei Popescu 0001 |
Renaming-Enriched Sets (Rensets) and Renaming-Based Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Formal Proofs ![In: Arch. Formal Proofs 2023, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
13 | Petr Vojcák |
Non-Abelian covering and new recursion operators for the 4D Martínez Alonso-Shabat equation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. Nonlinear Sci. Numer. Simul. ![In: Commun. Nonlinear Sci. Numer. Simul. 118, pp. 107007, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Andrei Popescu 0001 |
Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 67(3), pp. 23, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Ryo Hatano, Katsuhiko Sano |
Three faces of recursion axioms: the case of constructive dynamic logic of relation changers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Comput. ![In: J. Log. Comput. 33(6), pp. 1399-1436, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Paul Downen, Zena M. Ariola |
Classical (co)recursion: Mechanics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Funct. Program. ![In: J. Funct. Program. 33, pp. e4, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Bahareh Afshari, Dominik Wehr |
Exact bounds for acyclic higher-order recursion schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 290, pp. 104982, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Hui Zhang, Zhengpeng Yuan, Naihua Xiu |
Recursion Newton-Like Algorithm for l2,0-ReLU Deep Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Neural Networks Learn. Syst. ![In: IEEE Trans. Neural Networks Learn. Syst. 34(9), pp. 5882-5896, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Joachim Tilsted Kristensen, Robin Kaarsgaard, Michael Kirkedal Thomsen |
Tail Recursion Transformation for Invertible Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RC ![In: Reversible Computation - 15th International Conference, RC 2023, Giessen, Germany, July 18-19, 2023, Proceedings, pp. 73-88, 2023, Springer, 978-3-031-38099-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Alexandre Belling, Azam Soleimanian, Olivier Bégassat |
Recursion over Public-Coin Interactive Proof Systems; Faster Hash Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCS ![In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023, Copenhagen, Denmark, November 26-30, 2023, pp. 1422-1436, 2023, ACM. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Steffen van Bergerem, Martin Grohe, Sandra Kiefer, Luca Oeljeklaus |
Simulating Logspace-Recursion with Logarithmic Quantifier Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS, pp. 1-13, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Valentin Blot |
Diller-Nahm Bar Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSCD ![In: 8th International Conference on Formal Structures for Computation and Deduction, FSCD 2023, July 3-6, 2023, Rome, Italy, pp. 32:1-32:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-277-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Andong Fan, Lionel Parreaux |
super-Charging Object-Oriented Programming Through Precise Typing of Open Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECOOP ![In: 37th European Conference on Object-Oriented Programming, ECOOP 2023, July 17-21, 2023, Seattle, Washington, United States, pp. 11:1-11:28, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-281-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Hongbin Wu, Feixiong Chen, Zhenguo Shao, Yiwei Chen |
Multi-energy Flow Recursion Method for Integrated Electricity-Gas System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
iSPEC ![In: IEEE Sustainable Power and Energy Conference, iSPEC 2023, Chongqing, China, November 28-30, 2023, pp. 1-5, 2023, IEEE, 979-8-3503-2269-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Jishnu Ray Chowdhury, Cornelia Caragea |
Efficient Beam Tree Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans, LA, USA, December 10 - 16, 2023., 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
13 | Henning Basold, Tanjona Ralaivaosaona |
Composition and Recursion for Causal Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALCO ![In: 10th Conference on Algebra and Coalgebra in Computer Science, CALCO 2023, June 19-21, 2023, Indiana University Bloomington, IN, USA, pp. 18:1-18:17, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-287-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Behrooz Tahmasebi, Derek Lim, Stefanie Jegelka |
The Power of Recursion in Graph Neural Networks for Counting Substructures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISTATS ![In: International Conference on Artificial Intelligence and Statistics, 25-27 April 2023, Palau de Congressos, Valencia, Spain., pp. 11023-11042, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
13 | Soochan Lee, Gunhee Kim |
Recursion of Thought: A Divide-and-Conquer Approach to Multi-Context Reasoning with Language Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACL (Findings) ![In: Findings of the Association for Computational Linguistics: ACL 2023, Toronto, Canada, July 9-14, 2023., pp. 623-658, 2023, Association for Computational Linguistics, 978-1-959429-62-3. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
13 | Bolei Di, Andrew G. Lamperski |
Newton's Method, Bellman Recursion and Differential Dynamic Programming for Unconstrained Nonlinear Dynamic Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Dyn. Games Appl. ![In: Dyn. Games Appl. 12(2), pp. 394-442, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Yizhou Zhang 0001, Nada Amin |
Reasoning about "reasoning about reasoning": semantics and contextual equivalence for probabilistic programs with nested queries and recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Proc. ACM Program. Lang. ![In: Proc. ACM Program. Lang. 6(POPL), pp. 1-28, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Bergfinnur Durhuus, Angelo Lucia |
Recursion relations for chromatic coefficients for graphs and hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discuss. Math. Graph Theory ![In: Discuss. Math. Graph Theory 42(1), pp. 101-121, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Dongjie Liu, Chein-Shan Liu |
Two-point generalized Hermite interpolation: Double-weight function and functional recursion methods for solving nonlinear equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Comput. Simul. ![In: Math. Comput. Simul. 193, pp. 317-330, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Yang Wang 0006, Min Li, Hao Dai, Kenneth B. Kent, Kejiang Ye, Chengzhong Xu 0001 |
Deadlock Avoidance Algorithms for Recursion-Tree Modeled Requests in Parallel Executions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 71(9), pp. 2073-2087, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Wolfgang Dvorák, Markus Ulbricht 0001, Stefan Woltran |
Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 74, pp. 1403-1447, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Gordon D. Plotkin |
Recursion does not always help. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.08413, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Jing Yang 0035, Fang-Wei Fu 0001 |
Post-quantum Multi-stage Secret Sharing Schemes using Inhomogeneous Linear Recursion and Ajtai's Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.09026, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
13 | Nikolai Kudasov, Mikhail Olokin, Oleksii Potyomkin, Nikolay Shilov 0002, Maxim Stepanov |
Detecting unanticipated mutual recursion using Elegant Objects representation of object-oriented programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.01803, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Cristina Matache, Sean K. Moss, Sam Staton |
Concrete categories and higher-order recursion (With applications including probability, differentiability, and full abstraction). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.15917, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Adrian Francalanza, Anna Ingólfsdóttir |
Complexity through Translations for Modal Logic with Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GandALF ![In: Proceedings of the 13th International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2022, Madrid, Spain, September 21-23, 2022., pp. 34-48, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Andrei Popescu 0001 |
Rensets and Renaming-Based Recursion for Syntax with Bindings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.09233, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Zhixuan Yang, Nicolas Wu |
Fantastic Morphisms and Where to Find Them: A Guide to Recursion Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.13633, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
13 | David Barozzini, Pawel Parys, Jan Wroblewski |
Unboundedness for Recursion Schemes: A Simpler Type System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.11023, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Ji Zhao 0017, Yuzong Mu, Yanping Qiao, Qiang Li 0034 |
Newton Recursion Based Random Data-Reusing Generalized Maximum Correntropy Criterion Adaptive Filtering Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Entropy ![In: Entropy 24(12), pp. 1845, December 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Alexandre Belling, Azam Soleimanian, Olivier Bégassat |
Recursion over Public-Coin Interactive Proof Systems; Faster Hash Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2022, pp. 1072, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
13 | Mikhail B. Sheftel, D. Yazici |
Recursion operators and bi-Hamiltonian representations of cubic evolutionary (2+1)-dimensional systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. Nonlinear Sci. Numer. Simul. ![In: Commun. Nonlinear Sci. Numer. Simul. 112, pp. 106527, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Luca Aceto, Antonis Achilleos, Elli Anastasiadi, Anna Ingólfsdóttir |
Axiomatizing recursion-free, regular monitors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Algebraic Methods Program. ![In: J. Log. Algebraic Methods Program. 127, pp. 100778, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Ugo Dal Lago, Reinhard Kahle, Isabel Oitavem |
Implicit recursion-theoretic characterizations of counting classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 61(7-8), pp. 1129-1144, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Tahani Aljohani, Alexandra I. Cristea, Laila Alrajhi |
Bi-directional Mechanism for Recursion Algorithms: A Case Study on Gender Identification in MOOCs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AIED (2) ![In: Artificial Intelligence in Education. Posters and Late Breaking Results, Workshops and Tutorials, Industry and Innovation Tracks, Practitioners' and Doctoral Consortium - 23rd International Conference, AIED 2022, Durham, UK, July 27-31, 2022, Proceedings, Part II, pp. 396-399, 2022, Springer, 978-3-031-11646-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Tomoyuki Yamakami |
Expressing Power of Elementary Quantum Recursion Schemes for Quantum Logarithmic-Time Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WoLLIC ![In: Logic, Language, Information, and Computation - 28th International Workshop, WoLLIC 2022, Iași, Romania, September 20-23, 2022, Proceedings, pp. 88-104, 2022, Springer, 978-3-031-15297-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Zhixuan Yang, Nicolas Wu |
Fantastic Morphisms and Where to Find Them - A Guide to Recursion Schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MPC ![In: Mathematics of Program Construction - 14th International Conference, MPC 2022, Tbilisi, Georgia, September 26-28, 2022, Proceedings, pp. 222-267, 2022, Springer, 978-3-031-16911-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Cristina Matache, Sean K. Moss, Sam Staton |
Concrete categories and higher-order recursion: With applications including probability, differentiability, and full abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022, pp. 57:1-57:14, 2022, ACM, 978-1-4503-9351-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Valentin Blot |
A direct computational interpretation of second-order arithmetic via update recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2 - 5, 2022, pp. 62:1-62:11, 2022, ACM, 978-1-4503-9351-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | David Barozzini, Pawel Parys, Jan Wroblewski |
Unboundedness for Recursion Schemes: A Simpler Type System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France., pp. 112:1-112:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-235-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Sotaro Katayama, Toshiyuki Ohtsuka |
Efficient Riccati recursion for optimal control problems with pure-state equality constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACC ![In: American Control Conference, ACC 2022, Atlanta, GA, USA, June 8-10, 2022, pp. 3579-3586, 2022, IEEE, 978-1-6654-5196-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Benedek Nagy |
From Finite Automata to Fractal Automata - The Power of Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCU ![In: Machines, Computations, and Universality - 9th International Conference, MCU 2022, Debrecen, Hungary, August 31 - September 2, 2022, Proceedings, pp. 109-125, 2022, Springer, 978-3-031-13501-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Natalie Kiesler |
Mental Models of Recursion: A Secondary Analysis of Novice Learners' Steps and Errors in Java Exercises. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPIG ![In: Proceedings of the 33rd Annual Workshop of the Psychology of Programming Interest Group, PPIG 2022, The Open University, Milton Keynes, UK & Online, September 5-9, 2022, pp. 226-240, 2022, Psychology of Programming Interest Group. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
13 | Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler |
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12 - 17, 2022, pp. 325-336, 2022, ACM, 978-1-4503-9260-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Sean Mackay |
What Does Literature Tell Us About Recursion? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGCSE (2) ![In: SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, Providence, RI, USA, March 3-5, 2022, Volume 2, pp. 1173, 2022, ACM, 978-1-4503-9071-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Andrei Popescu 0001 |
Rensets and Renaming-Based Recursion for Syntax with Bindings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAR ![In: Automated Reasoning - 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8-10, 2022, Proceedings, pp. 618-639, 2022, Springer, 978-3-031-10768-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Azadeh Farzan, Danya Lette, Victor Nicolet |
Recursion synthesis with unrealizability witnesses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13 - 17, 2022, pp. 244-259, 2022, ACM, 978-1-4503-9265-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Rusi P. Mody, Anuradha Laxminarayan, Jayant Kirtane |
Recursion: Squeezing the Infinite into the Finite. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FIE ![In: IEEE Frontiers in Education Conference, FIE 2022, Uppsala, Sweden, October 8-11, 2022, pp. 1-9, 2022, IEEE, 978-1-6654-6244-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Maycon Amaro, Samuel da Silva Feitosa, Rodrigo Geraldo Ribeiro |
A Sound Strategy to Compile General Recursion into Finite Depth Pattern Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SBMF ![In: Formal Methods: Foundations and Applications - 25th Brazilian Symposium, SBMF 2022, Virtual Event, December 6-9, 2022, Proceedings, pp. 39-54, 2022, Springer, 978-3-031-22475-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Jintao Zhang, Xiao Sun 0003, Yuanlin Li |
Mining Syntactic Relationships via Recursion and Wandering on A Dependency Tree for Aspect-Based Sentiment Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCNN ![In: International Joint Conference on Neural Networks, IJCNN 2022, Padua, Italy, July 18-23, 2022, pp. 1-8, 2022, IEEE, 978-1-7281-8671-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
13 | Andong Fan |
Simple Extensible Programming through Precisely-Typed Open Recursion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPLASH Companion ![In: Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity, SPLASH Companion 2022, Auckland, New Zealand, December 5-10, 2022, pp. 54-56, 2022, ACM, 978-1-4503-9901-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #501 - #600 of 2517 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ 15][ >>] |
|