Gotowa bibliografia na temat „Problème de Turán”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Problème de Turán”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Problème de Turán"
KEEVASH, PETER, DHRUV MUBAYI, BENNY SUDAKOV i JACQUES VERSTRAËTE. "Rainbow Turán Problems". Combinatorics, Probability and Computing 16, nr 01 (4.09.2006): 109. http://dx.doi.org/10.1017/s0963548306007760.
Pełny tekst źródłaBollobás, Béla. "Turán-Ramsey problems". Discrete Mathematics 156, nr 1-3 (wrzesień 1996): 257–62. http://dx.doi.org/10.1016/0012-365x(96)00024-6.
Pełny tekst źródłaKeevash, Peter, Mike Saks, Benny Sudakov i Jacques Verstraëte. "Multicolour Turán problems". Advances in Applied Mathematics 33, nr 2 (sierpień 2004): 238–62. http://dx.doi.org/10.1016/j.aam.2003.08.005.
Pełny tekst źródłaFrankl, Peter, Hao Huang i Vojtěch Rödl. "On local Turán problems". Journal of Combinatorial Theory, Series A 177 (styczeń 2021): 105329. http://dx.doi.org/10.1016/j.jcta.2020.105329.
Pełny tekst źródłaBOLLOBÁS, BÉLA, IMRE LEADER i CLAUDIA MALVENUTO. "Daisies and Other Turán Problems". Combinatorics, Probability and Computing 20, nr 5 (18.08.2011): 743–47. http://dx.doi.org/10.1017/s0963548311000319.
Pełny tekst źródłaMubayi*, Dhruv, i Vojtěch Rödl†. "Supersaturation For Ramsey-Turán Problems". Combinatorica 26, nr 3 (czerwiec 2006): 315–32. http://dx.doi.org/10.1007/s00493-006-0018-x.
Pełny tekst źródłaMubayi, Dhruv, i Yi Zhao. "Non-uniform Turán-type problems". Journal of Combinatorial Theory, Series A 111, nr 1 (lipiec 2005): 106–10. http://dx.doi.org/10.1016/j.jcta.2004.11.010.
Pełny tekst źródłaBennett, Patrick, Sean English i Maria Talanda-Fisher. "Weighted Turán problems with applications". Discrete Mathematics 342, nr 8 (sierpień 2019): 2165–72. http://dx.doi.org/10.1016/j.disc.2019.04.007.
Pełny tekst źródłaFrankl, Peter, i Jiaxi Nie. "On asymptotic local Turán problems". Moscow Journal of Combinatorics and Number Theory 12, nr 4 (8.12.2023): 273–86. http://dx.doi.org/10.2140/moscow.2023.12.273.
Pełny tekst źródłaMani, Nitya, i Edward Yu. "Turán problems for mixed graphs". Journal of Combinatorial Theory, Series B 167 (lipiec 2024): 119–63. http://dx.doi.org/10.1016/j.jctb.2024.02.004.
Pełny tekst źródłaRozprawy doktorskie na temat "Problème de Turán"
Zhou, Wenling. "Embedding problems in uniformly dense hypergraphs". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG092.
Pełny tekst źródłaGiven a k-graph (k-uniform hypergraph) F, the Turán density π(F) of F is the maximum density among all F-free k-graphs. Determining π(F) for a given k-graph F is a classical extremal problem. Given two k-graphs F and H, a perfect F-tiling (or F-factor) of H is a collection of vertex-disjoint copies of F in H that together cover all the vertices of H. Perfect tiling problems, as a strengthening of the Turán problem, aim to find extremal conditions on H which guarantee an F-factor, which also has a long and profound history. In this thesis, we use many powerful tools including the probabilistic method, hypergraph regularity method and absorbing method to study Turán densities and perfect tilings of given k-graphs F in uniformly dense hypergraphs. Unlike graphs, we all know that there are several non-equivalent notions of quai-randomness in k-graphs for k ≥ 3. Hence, our work also has several non-equivalent definitions of uniformly dense k-graphs. Roughly speaking, a k-graph H is (d, μ, ⋆)-dense means that it is d-dense and ⋆-quai-randomness for some small μ > 0 with respect to given random structures. Restricting to (d, μ, 1)-dense 3-graphs, the Turán density of a given 3-graph F is denoted by π1(F). Determining π1(F) was suggested by Erdős and Sós in the 1980s. In 2018, Reiher, Rödl and Schacht extended the concept of (d, μ, 1)-dense 3-graphs to (d, μ, k-2)-dense k-graphs for k ≥ 3, and they proposed the study of uniform Turán density πk-2(F) for a given k-graph F in (d, μ, k-2)-dense k-graphs. In particular, they showed that πk-2(•) “jumps” from 0 to at least k-to-the-minus-kth-power. In this thesis, we obtain a sufficient condition for 3-graphs F which satisfy π1(F)= 1/4. Interestingly, currently all known 3-graphs F whose π1(F) is 1/4 satisfy this condition. In addition, we also construct some intriguing 3-graphs F with π1(F) = 1/4. For k-graphs, we give a framework to study πk-2(F) for any k-graph F. By using this framework, we give a sufficient condition for k-graphs F satisfying πk-2(F) is k-to-the-minus-kth-power, and construct an infinite family of k-graphs with πk-2(F) is k-to-the-minus-kth-power.In 2016, Lenz and Mubayi posed the problem of characterizing the k-graphs F such that every sufficiently large (d, μ, dot)-dense k-graph H with d > 0, v(F)|v(H) and positive minimum vertex degree contains an F-factor. Motivated by this problem, we prove a general theorem on F-factors which reduces the F-factors problem of Lenz and Mubayi to a natural sub-problem, that is, the F-cover problem. By using this result, we answer the question of Lenz and Mubayi for those F which are k-partite k-graphs and for all 3-graphs F, separately. In the work of Lenz and Mubayi, they also constructed a sequence of (1/8, μ, dot)-dense 3-graphs with positive minimum vertex degree having no F-factor, where F is a balanced complete 3-partite 3-graph. In this thesis, we prove that 1/8 is the density threshold for ensuring all 3-partite 3-graphs perfect tilings in (d, μ, dot)-dense 3-graphs given a minimum codegree condition Ω(n). Moreover, we show that one can not replace the minimum codegree condition with a minimum vertex degree condition. In particular, we study the optimal density threshold of F-factors for each 3-partite 3-graph F in (d, μ, dot)-dense 3-graphs with minimum codegree Ω(n). In addition, we also study F-factor problems for k-partite k-graphs F with stronger quasi-random assumption and positive minimum 1-degree
Lantz, Emilott. "What can Turán tell us about the hypercube?" Thesis, Umeå universitet, Institutionen för matematik och matematisk statistik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-57789.
Pełny tekst źródłaTurán-problemet är det fundamentala problemet inom extremal grafteori. Det ställer frågan vad det maximala antalet kanter en given graf G kan ha utan att innehålla någon förbjuden graf H, och löses med hjälp av Turán-talet ex(n,H), -densiteten π(H) and -grafen Tr(n). Turáns sats säger oss att Turán-grafen Tr(n) är den största Kr+1-fria enkla grafen på n hörn. Denna uppsats är en överblick av Turán-problem i klickar Kn, hyperkuber Qn och Hamming-grafer H(s,d). Vi avslutar den med att bevisa ett nytt resultat som vi kallar "lagersatsen", vilket löser Hamming-Turán-problemet med hjälp av en metod som skapar lager av hörnen i en graf. Lagersatsen ger en undre gräns för den Hamming-relativa Turán-densiteten enligt följande: där för den förbjudna grafen F som sträcker sig över t lager samt r = χ(F).
Celik, Melih. "The Order-picking Problem In Parallel-aisle Warehouses". Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/3/12610646/index.pdf.
Pełny tekst źródłaBenvenuti, Andrea. "The end of the affair : Britain's turn to Europe as a problem in Anglo-Australian relations (1961-72)". Thesis, University of Oxford, 2003. http://ora.ox.ac.uk/objects/uuid:4cdd0762-669b-4370-9ceb-b93dfe4336b1.
Pełny tekst źródłaThompson, Damian. "The problem of the end : a sociological study of the management of apocalyptic faith at Kensington Temple, a London Pentecostal church, at the turn of the millennium". Thesis, London School of Economics and Political Science (University of London), 2003. http://etheses.lse.ac.uk/2667/.
Pełny tekst źródłaAbia, Sonny D. "Application of Reliability Analysis to Highway Design Problems: Superelevation (e) Design, Left Turn Bay Design-Safety Evaluation and Effect of Variation of Peak Hour Volumes on Intersection Signal Delay Performance". Scholarly Repository, 2010. http://scholarlyrepository.miami.edu/oa_dissertations/447.
Pełny tekst źródłaCunha, Carla Maria Santana Duarte Correia da. "Minimização do número de más viragens na recolha de resíduos sólidos urbanos". Master's thesis, Instituto Superior de Economia e Gestão, 2001. http://hdl.handle.net/10400.5/18825.
Pełny tekst źródłaO problema da determinação de percursos a efectuar por veículos afectos à remoção de resíduos sólidos urbanos pode ser visto como um problema de optimização de rotas, com procura nos arcos e restrições adicionais. Usualmente os algoritmos para determinar soluções admissíveis para este tipo de problemas não têm em conta o tipo de viragem que os veículos são obrigados a fazer. Dadas as características dos veículos envolvidos na recolha de resíduos, entende-se por má viragem uma inversão de marcha ou uma viragem à esquerda. Na prática é, em geral, exigida a minimização do número de más viragens, devendo mesmo algumas ser impossibilitadas, quer por se tornarem perigosas, quer por questões de regras de trânsito. Neste trabalho o problema da minimização do número de más viragens é definido e modelizado como um problema de redes. São desenvolvidos métodos para a determinação de soluções admissíveis. Os métodos implementados são testados num conjunto de problemas teste gerados aleatoriamente. Como se mostra, os resultados podem ser considerados bastante bons, dado permitirem obter soluções com um baixo número de más viragens sendo evitadas a quase totalidade das inversões de marcha proibidas. Muito embora a heurística se baseie na expansão da rede nos nodos onde as inversões de marcha não são permitidas, os resultados permitiram concluir que nem todos os nodos têm que ser expandidos para que as respectivas inversões de marcha sejam impossibilitadas.
Finding the optimal set of tours for vehicles dedicated to household refuse collection can be looked at as an are routing problem with additional constraints. Typically, the algorithms used in determining feasible solutions to these problems do not account for the type of turn that the vehicles actually must perform. Given the specifíc characteristics of the vehicles assigned to household refuse collection, a bad-turn translates to a U-turn or to a left-turn. In practical terms it is generally mandatory to minimize the total number of bad-turns, some of which really must be avoided either due to its intrinsic danger or to traffic regulation restrictions. Throughout this thesis the problem of minimizing the number of bad-turns is defmed and modeled as a network problem. Some methods are developed to determine feasible solutions. These methods have been tested over a set of randomly generated problems. It is shown that the overall results are to be considered pretty good since they represent feasible solutions with a very low number of bad-turns, where nearly every forbidden U-turns are avoided.
info:eu-repo/semantics/publishedVersion
Ritucci, Raffaella. "Bambine e ragazzi bilingui nelle classi multietniche di Torino". Doctoral thesis, Humboldt-Universität zu Berlin, 2018. http://dx.doi.org/10.18452/19485.
Pełny tekst źródłaThe Italian Ministry of Education (MIUR) student register records that today in Italy more than one out of ten students is not an Italian citizen, although the majority of them were born there. Several statistical surveys indicate that "foreign" students, when compared to native students, show a poorer performance in Italian and in academic achievement. This exploratory fieldwork carried out in schools in Turin (5th to 8th grade) analyzed data obtained through semi-structured interviews with 121 students and 26 parents as well as 141 questionnaires filled in by 27 teachers of Italian and family language. It showed that many students are "bilingual natives", as they grow up acquiring both Italian and another language; however, despite the fact that the interviewees rate polyglottism positively, schools don't usually offer targeted support in either language. Within the cohort the broadest range of competences in Italian are found first among those with an Italian-speaking parent, then among those who arrived in Italy at pre-school age attending kindergarten there; this latter group shows higher competences than those born in Italy attending nursery there, as also in the INVALSI tests. As far as family language is concerned, data illustrate that its teaching increases its competences without affecting those in Italian: quite the opposite in fact. These results confirm the remarkable role played by the "other" language in successful language education. MIUR is therefore called upon to include also linguistic data in its student register, so as to redefine its curricula according to EU Guidelines, and to identify specific procedures and resources for multilingual classes. This new policy would reduce the current cost of placing students in a lower grade, grade retention and drop-outs, and would promote school success, equal opportunities and multilingualism, with positive consequences both for the individuals and for the national economy.
L'anagrafe studenti del MIUR registra come oggi in Italia più di uno studente su dieci non è cittadino italiano, pur essendo la maggioranza di loro nata in questo paese. Numerose indagini statistiche mostrano come gli allievi "stranieri" presentino, rispetto a quelli italiani, ridotte competenze in italiano e minore successo scolastico. Questa ricerca esplorativa svolta in alcune scuole di Torino (V elementare-III media) ha analizzato dati ottenuti tramite interviste semi-strutturate a 121 studenti e 26 genitori e 141 questionari compilati da 27 insegnanti di italiano e di lingua di famiglia. Da essa è emerso che molti studenti sono "nativi bilingui", poiché crescono usando l'italiano e un'altra lingua. Questo poliglottismo, valutato dagli intervistati assai positivamente, non si rispecchia però nella prassi scolastica: un supporto mirato in italiano e l'insegnamento della lingua di famiglia sono di regola una chimera. All'interno del campione le più ampie competenze in italiano si trovano fra chi ha un genitore italofono e chi è arrivato in Italia in età prescolare frequentandovi la scuola materna; come constatato anche nei test INVALSI, chi è nato in Italia e vi ha frequentato l'asilo nido è leggermente svantaggiato. Rispetto alla lingua di famiglia risulta che il suo studio porta a migliori competenze in essa, senza nuocere all'italiano: anzi. Emerge quindi il ruolo significativo della lingua "altra" per un'educazione linguistica efficace. L'invito al MIUR è quindi di integrare la propria anagrafe con dati linguistici, così da ridefinire i propri curricula secondo le Linee Guida Comunitarie, individuando procedure e risorse specifiche per le classi multilingui. Con un investimento ridotto, paragonato con il costo attuale dato da retrocessioni, ripetenze e abbandono scolastico, si riuscirebbe a sostenere il successo scolastico, le pari opportunità e il plurilinguismo, con conseguenze positive per i singoli e per l'economia nazionale.
Tinawi, Félix. "Solution de C. Hyltén-Cavallius pour un problème de P. Turán concernant des polynômes". Thèse, 2008. http://hdl.handle.net/1866/7876.
Pełny tekst źródła"Some Turan-type Problems in Extremal Graph Theory". Doctoral diss., 2018. http://hdl.handle.net/2286/R.I.50112.
Pełny tekst źródłaDissertation/Thesis
Doctoral Dissertation Mathematics 2018
Książki na temat "Problème de Turán"
How to turn computer problems into competitive advantage. Newtown Square, Pa., USA: Project Management Institute, 1998.
Znajdź pełny tekst źródłaGagné, Antoinette. It's your turn. [Lasalle, Qubec]: Didier, 1987.
Znajdź pełny tekst źródłaNora, Antonio. Caritas Christi urget nos: Il carisma e la spiritualità cottolenghina : aspetti ecclesiologici. Cantalupa (Torino): Effatà, 2008.
Znajdź pełny tekst źródłaCaritas Christi urget nos: Il carisma e la spiritualità cottolenghina : aspetti ecclesiologici. Cantalupa (Torino): Effatà, 2008.
Znajdź pełny tekst źródłaGrowing through crises: How to turn problems into opportunities. Basingstoke: Marshalls, 1985.
Znajdź pełny tekst źródłaLutz, Musner, Wuneberg Gotthart, Lutter Christina i Internationales Forschungszentrum Kulturwissenschaften, red. Cultural Turn: Zur Geschichte der Kulturwissenschaften. Wien: Turia + Kant, 2001.
Znajdź pełny tekst źródłaWillan, Anne. A cook's book of quick fixes: How to turn adversity into opportunity. London: Quadrille, 2005.
Znajdź pełny tekst źródła1944-, Digel Helmut, red. Turn- und Sportvereine: Strukturen, Probleme, Trends : eine Analyse der Vereine im Deutschen Turner-Bund. Aachen: Meyer & Meyer, 1992.
Znajdź pełny tekst źródłaAnne, Edwards. Being an expert professional practitioner: The relational turn in expertise. Dordrecht [the Netherlands]: Springer, 2010.
Znajdź pełny tekst źródłaMaking Islam democratic: Social movements and the post-Islamist turn. Stanford, Calif: Stanford University Press, 2007.
Znajdź pełny tekst źródłaCzęści książek na temat "Problème de Turán"
Felsner, Stefan. "Geometric Graphs: Turán Problems". W Geometric Graphs and Arrangements, 1–16. Wiesbaden: Vieweg+Teubner Verlag, 2004. http://dx.doi.org/10.1007/978-3-322-80303-0_1.
Pełny tekst źródłaSoifer, Alexander. "E29: One Old Erdős–Turán Problem". W The Colorado Mathematical Olympiad: The Third Decade and Further Explorations, 217–20. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-52861-8_21.
Pełny tekst źródłaPawlak, Ralph R. "Torque-to-Turn Example". W Industrial Problem Solving Simplified, 189–95. Berkeley, CA: Apress, 2013. http://dx.doi.org/10.1007/978-1-4302-6578-8_14.
Pełny tekst źródłaMubayi, Dhruv, i Jacques Verstraëte. "A survey of Turán problems for expansions". W Recent Trends in Combinatorics, 117–43. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-24298-9_5.
Pełny tekst źródłaKonyagin, Sergei V., i Vsevolod F. Lev. "The Erdős–Turán Problem in Infinite Groups". W Additive Number Theory, 195–202. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-68361-4_14.
Pełny tekst źródłaKent, Thomas. "14. Hermeneutics and Genre: Bakhtin and the Problem of Communicative Interaction". W The Interpretive Turn, 282–303. Ithaca, NY: Cornell University Press, 2020. http://dx.doi.org/10.7591/9781501735028-016.
Pełny tekst źródłaBonczek, Rose Burnett, Roger Manix i David Storck. "We are the people to solve this problem". W Turn That Thing Off!, 120–36. Milton Park, Abingdon, Oxon ; New York : Routledge, 2017.: Routledge, 2018. http://dx.doi.org/10.4324/9781315559759-7.
Pełny tekst źródłaGehler, Michael, i Robert Rollinger. "Imperial Turn: Challenges, Problems and Questions". W Universal- und kulturhistorische Studien. Studies in Universal and Cultural History, 3–39. Wiesbaden: Springer Fachmedien Wiesbaden, 2022. http://dx.doi.org/10.1007/978-3-658-34003-2_1.
Pełny tekst źródłaScherr, Albert. "Was kann Jugendforschung zur Konturierung einer sozialwissenschaftlich aufgeklärten Jugendpolitik beitragen? Probleme und Perspektiven im Verhältnis von Jugendforschung und Jugendpolitik". W Political (Re)Turn?, 43–56. Wiesbaden: VS Verlag für Sozialwissenschaften, 2012. http://dx.doi.org/10.1007/978-3-531-18963-5_3.
Pełny tekst źródłaBerdysheva, Elena E., i Hubert Berens. "On a Discrete Turán Problem for ℓ-1 Radial Functions". W New Perspectives on Approximation and Sampling Theory, 447–68. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08801-3_19.
Pełny tekst źródłaStreszczenia konferencji na temat "Problème de Turán"
Gishboliner, Lior, i Asaf Shapira. "A generalized Turán problem and its applications". W STOC '18: Symposium on Theory of Computing. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3188745.3188778.
Pełny tekst źródłaSudakov, Benny. "Recent Developments in Extremal Combinatorics: Ramsey and Turán Type Problems". W Proceedings of the International Congress of Mathematicians 2010 (ICM 2010). Published by Hindustan Book Agency (HBA), India. WSPC Distribute for All Markets Except in India, 2011. http://dx.doi.org/10.1142/9789814324359_0159.
Pełny tekst źródłaFujii, Hironori A., Tomoo Tone i Takeo Watanabe. "Turn over Problem of Tether Satellite System". W 56th International Astronautical Congress of the International Astronautical Federation, the International Academy of Astronautics, and the International Institute of Space Law. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2005. http://dx.doi.org/10.2514/6.iac-05-c1.p.24.
Pełny tekst źródłaMityushov, E. A., N. E. Misyura i A. E. Lamotkin. "Designing a program trajectory of a smooth turn". W PROCEEDINGS INTERNATIONAL CONFERENCE “PROBLEMS OF APPLIED MECHANICS”. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0048046.
Pełny tekst źródłaBielak, Halina, i Kamil Powroźnik. "An efficient algorithm for the density Turán problem of some unicyclic graphs". W 2014 Federated Conference on Computer Science and Information Systems. IEEE, 2014. http://dx.doi.org/10.15439/2014f297.
Pełny tekst źródłaГабдуллин, Салават. "VERBATIM RELATIONS IN TURN WITH COLLATERAL VALUE IN MODERN GERMAN". W GERMAN IN BASHKORTOSTAN: PROBLEMS AND PROSPECTS. Baskir State University, 2022. http://dx.doi.org/10.33184/nyvb2022-2022-04-29.2.
Pełny tekst źródłaLavrenov, Eugeniy O., Zoya S. Temlyakova i Mikhail E. Vilberger. "Estimate of Turn-to-Turn Short Circuit Influence on an Induction Motor Operation Quality". W 2018 XIV International Scientific-Technical Conference on Actual Problems of Electronics Instrument Engineering (APEIE). IEEE, 2018. http://dx.doi.org/10.1109/apeie.2018.8546117.
Pełny tekst źródłaHu, Liru. "Turn-Taking Patterns in Dialogic Collaborative Problem Solving". W 2020 AERA Annual Meeting. Washington DC: AERA, 2020. http://dx.doi.org/10.3102/1586794.
Pełny tekst źródłaIlyushenka, Nadzeya. "Digital learning: prospects and risks of digital turn in education". W 2nd International Conference “Futurity designing. Digital reality problems”. Keldysh Institute of Applied Mathematics, 2019. http://dx.doi.org/10.20948/future-2019-20.
Pełny tekst źródłaDai, Lei. "Cultural Turn and Chinese Literature’s Go-global: Problems and Solutions". W Proceedings of the 2019 International Conference on Management, Education Technology and Economics (ICMETE 2019). Paris, France: Atlantis Press, 2019. http://dx.doi.org/10.2991/icmete-19.2019.68.
Pełny tekst źródłaRaporty organizacyjne na temat "Problème de Turán"
Reddy, T., R. Ravindranath, M. Perumal i A. Yegin. Problems with Session Traversal Utilities for NAT (STUN) Long-Term Authentication for Traversal Using Relays around NAT (TURN). RFC Editor, wrzesień 2014. http://dx.doi.org/10.17487/rfc7376.
Pełny tekst źródłaGoreczky, Péter, i Tibor Mezei. Breaking the Impasse? Chances of a Positive Turn in South Korea-Japan Relations. Külügyi és Külgazdasági Intézet, 2022. http://dx.doi.org/10.47683/kkielemzesek.ke-2022.25.
Pełny tekst źródłaMoreno de Acevedo Sánchez, Enrique. State-owned Enterprise Management: Advantages of Centralized Models. Inter-American Development Bank, maj 2016. http://dx.doi.org/10.18235/0007966.
Pełny tekst źródłaHuntzinger, Hervé, Pierre Kopp i Rémy Prud'homme. Stronger Municipalities for Stronger Cities in Argentina. Inter-American Development Bank, luty 2004. http://dx.doi.org/10.18235/0008997.
Pełny tekst źródłaMIROLYUBOVA, S., D. VOROBYEV i S. BUGROVA. SPEAKING OF OPTIMIZING THE MANAGEMENT OF CURRENT ASSETS OF ENTERPRISES IN THE DIGITAL ECONOMY. Science and Innovation Center Publishing House, 2022. http://dx.doi.org/10.12731/2070-7568-2022-11-1-4-23-31.
Pełny tekst źródłaClark, Louise, i Joe Taylor. ALRE Report on Evidence Demand on Inclusive Agricultural Commercialisation in Africa. APRA, Future Agricultures Consortium, kwiecień 2022. http://dx.doi.org/10.19088/apra.2022.038.
Pełny tekst źródłaMcDonald, William, Jerry Haston, Mark Gredell i Mark Benson. GRl-95-0455 Howell Storage Field Horizontal Well Field Experiment. Chantilly, Virginia: Pipeline Research Council International, Inc. (PRCI), maj 1995. http://dx.doi.org/10.55274/r0011174.
Pełny tekst źródłaKürsat Önder, Yasin, Mauricio Villamizar-Villegas i Jose Villegas. Debt Moratorium: Theory and Evidence. Banco de la República, październik 2023. http://dx.doi.org/10.32468/be.1253.
Pełny tekst źródłaAmengual, Dante, Xinyue Bei, Marine Carrasco i Enrique Sentana. Score-type tests for normal mixtures. CIRANO, styczeń 2023. http://dx.doi.org/10.54932/uxsg1990.
Pełny tekst źródłaGamba-Santamaria, Santiago, Luis Fernando Melo-Velandia i Camilo Orozco-Vanegas. What can credit vintages tell us about non-performing loans? Banco de la República de Colombia, luty 2021. http://dx.doi.org/10.32468/be.1154.
Pełny tekst źródła