Academic literature on the topic 'Polylgot'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Polylgot.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Polylgot"
Agarwal, Dinesh K. "Agarwal PolyLoop Ligation Technique for the Management of the Distal Ureter during Laparoscopic Assisted Nephroureterectomy." Current Urology 13, no. 4 (2019): 209–13. http://dx.doi.org/10.1159/000499270.
Full textHoward Lee, M., and Jangil Kim. "Quantum gases and polylogs." Physica A: Statistical Mechanics and its Applications 304, no. 3-4 (February 2002): 421–28. http://dx.doi.org/10.1016/s0378-4371(01)00552-0.
Full textDietze, Gabriele. "Den ›anderen‹ Polylog wahrnehmen." Zeitschrift für Kulturwissenschaft 5, no. 2 (December 2011): 157–60. http://dx.doi.org/10.14361/zfk.2011.0219.
Full textJeltsch-Schudel, Barbara, Erica Brühlmann-Jecklin, Christina Fasser, Urs Kaiser, and Barbara Wenk. "Polylog: Behindert sein - älter werden." Vierteljahresschrift für Heilpädagogik und ihre Nachbargebiete 80, no. 2 (2011): 154–60. http://dx.doi.org/10.2378/vhn2011.art11d.
Full textVogt, Nina. "Lineage tracing with Polylox barcodes." Nature Methods 14, no. 10 (September 29, 2017): 940. http://dx.doi.org/10.1038/nmeth.4451.
Full textJo, Hae-jeong. "Buddhism and Intercultural philosophy : Emptiness(Śūnyatā) and Polylogue(Polylog)." Journal of Eastern-Asia Buddhism and Culture 29 (March 31, 2017): 527–56. http://dx.doi.org/10.21718/eabc.2017.29.18.
Full textAhn, Kook Jin, Graham Cormode, Sudipto Guha, Andrew McGregor, and Anthony Wirth. "Correlation Clustering in Data Streams." Algorithmica 83, no. 7 (March 13, 2021): 1980–2017. http://dx.doi.org/10.1007/s00453-021-00816-9.
Full textSamiullah, Sami, Hadi Bhurgri, Razvi Razack, and Sushil Ahlawat. "Salvaging a sticky situation: a stuck PolyLoop." Gastrointestinal Endoscopy 79, no. 4 (April 2014): 695–96. http://dx.doi.org/10.1016/j.gie.2013.10.041.
Full textBen-Sasson, Eli, and Madhu Sudan. "Short PCPs with Polylog Query Complexity." SIAM Journal on Computing 38, no. 2 (January 2008): 551–607. http://dx.doi.org/10.1137/050646445.
Full textFerrara, Margaret M. "Capturing Conversations of Change: The Polylog." Action in Teacher Education 22, sup2 (August 2000): 55–64. http://dx.doi.org/10.1080/01626620.2000.10463039.
Full textDissertations / Theses on the topic "Polylgot"
Schwarze, Michael. "Generische Wahrheit : höfischer Polylog im Werk Jean Froissarts /." Stuttgart : F. Steiner, 2003. http://catalogue.bnf.fr/ark:/12148/cb412914783.
Full textRößler, Jens [Verfasser], and Thomas [Akademischer Betreuer] Höfer. "Applications of Polylox barcoding to the hematopoietic system / Jens Rößler ; Betreuer: Thomas Höfer." Heidelberg : Universitätsbibliothek Heidelberg, 2020. http://d-nb.info/1217163824/34.
Full textWermann, Hartmut [Verfasser], and Hans P. [Akademischer Betreuer] Sturm. "Natur und Kultur im Polylog: Widerstreit und Harmonie des Denkens / Hartmut Wermann. Betreuer: Hans P. Sturm." Augsburg : Universität Augsburg, 2012. http://d-nb.info/1077700857/34.
Full textШульженко, Олександра Валентинівна. "Специфіка трагікомедій Неди Неждани «Дирижабль», «Колона черепах», «Той, що відчиняє двері», «Коли повертається дощ»." Магістерська робота, 2020. https://dspace.znu.edu.ua/jspui/handle/12345/1868.
Full textUA : Кваліфікаційна робота магістра «Специфіка трагікомедій Неди Неждани «Дирижабль», «Колона черепах», «Той, що відчиняє двері», «Коли повертається дощ» містить 64 сторінки. Для виконання роботи опрацьовано 60 джерел. Мета дослідження: розкрити специфіку та проаналізувати драматичні твори Неди Нежданої. У ході написання роботи виконано такі завдання: - досліджено особливості сучасного драматургічного тексту; - з’ясовано жанрові трансформації драматичних текстів ХІІ століття; - проаналізовано композиційні складові драматургічних текстів «Дирижабль», «Колона черепах», «Коли повертається дощ», «Той, що відчиняє двері»; - визначено особливості образної системи трагікомедій; - проаналізовано мовно-структурні елементи в трагікомедіях; Об’єкт дослідження: Трагікомедії: «Дирижабль», «Колона черепах», «Коли повертається дощ», «Той, що відчиняє двері» та інші. Предмет дослідження: специфіка організації і побудови трагікомедій Неди Нежданої. Методи дослідження. У роботі використано такі методи дослідження: аналіз, синтез, аналітично-описовий метод, теоретичне узагальнення. Наукова новизна роботи полягає в тому, що вона є першою спробою ґрунтовного аналізу та дослідження специфіки драматичних творів Неди Нежданої.
EN : Master's qualification work «The Specific of Tragicomedy «Dirigible», «The Column of Turtles», «One Who Opens the Door», «When the Rain Returns» by the Neda Nezhdana» contains 64 pages. 60 sources were processed for the work. The aim of the study: to discover the specific and analyze the dramatic works of Neda Nezhdana. During the writing of the work the following tasks were performed: - features of modern dramaturgical text have been investigated; - the genre transformations of dramatic texts of the XII century are clarified; - the compositional components of the dramatic texts «Dirigible», «The Column of Turtles», «One Who Opens the Door», «When the Rain Returns» are analyzed; - the features of the figurative system of tragicomedies were determined; - linguistic and structural elements in tragicomedy are analyzed. Object of study: Tragicomedy: Dirigible», «The Column of Turtles», «One Who Opens the Door», «When the Rain Returns»; Subject of research: the specifics of the organization and construction of the tragicomedy by the Neda Nezhdana Research methods. The following research methods are used in the work: analysis, synthesis, analytical and descriptive method, theoretical generalization. The scientific novelty of the work is that it is the first attempt at a thorough analysis and study of the specifics of Neda Nezhdana dramatic works. The scope of the work is that its materials can be used in the further development of the literary problems of the chosen theme, leading courses and special seminars on the history of Ukrainian literature of the twentieth century, when writing term papers, as well as elective courses on the history of Ukrainian literature at schools.
Books on the topic "Polylgot"
1954-, Mādhava Harṣadeva, ed. Amarakośaḥ: Sacitraḥ caturbhāṣāśobhitaḥ = multilingual ancient Sanskrit dictionary. Ahamadāvāda: Pārśva Pablikeśana, 2009.
Find full textDaniela, Stamatiadi, ed. He polylogou. Athens: Ekdoseis Parachos L. Kalfakis, 2003.
Find full textFlídrová, Helena. Sociolingvistické a psycholingvistické aspekty dialogu a polylogu v ruštině. Praha: Státní pedagogické nakl., 1989.
Find full text1963-, DeLossa Robert A., ed. [Rozmovli͡a︡ĭmo!] =: Let's talk! : a basic Ukrainian course with polylogs, grammar, and conversation lessons. Bloomington, Ind: Slavica Publishers, 2004.
Find full textMediale levenskunst: Een interculturele polyloog. Brussel: ASP, 2014.
Find full textGenerische Wahrheit: Höfischer Polylog im Werk Jean Froissarts. Stuttgart: F. Steiner, 2003.
Find full textKellermann, Paul. Die Geldgesellschaft und Ihr Glaube: Ein Interdisziplinärer Polylog. VS Verlag fur Sozialwissenschaften GmbH, 2007.
Find full textDie Geldgesellschaft und ihr Glaube: Ein interdisziplina rer Polylog. Wiesbaden: VS Verl. fu r Sozialwissenschaften, 2007.
Find full textRoyé, Hans-Walter. Segmentierung und Hervorhebung in Gesprochener Deutscher Standardsprache. Analyse Eines Fernseh-Polylogs. de Gruyter GmbH, Walter, 2017.
Find full textRomanchuk, Robert, Robert A. Delossa, R. Robert Koropeckyj, and Alexandra Isaievych Mason. Rozmovliaimo! (Let's Talk!): A Basic Ukrainian Course With Polylogs, Grammar, And Conversation Lessons. Slavica Pub, 2005.
Find full textBook chapters on the topic "Polylgot"
Hartz, Peter, and Hilarion G. Petzold. "Der POLYLOG." In Wege aus der Arbeitslosigkeit, 117–26. Wiesbaden: Springer Fachmedien Wiesbaden, 2013. http://dx.doi.org/10.1007/978-3-658-03708-6_9.
Full textDübgen, Franziska. "Gerechtigkeit im Polylog." In Transkulturelle Politische Theorie, 265–84. Wiesbaden: Springer Fachmedien Wiesbaden, 2015. http://dx.doi.org/10.1007/978-3-658-05010-8_13.
Full textGentry, Craig, Shai Halevi, and Nigel P. Smart. "Fully Homomorphic Encryption with Polylog Overhead." In Advances in Cryptology – EUROCRYPT 2012, 465–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29011-4_28.
Full textGlaßer, Christian. "Polylog-Time Reductions Decrease Dot-Depth." In STACS 2005, 170–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-31856-9_14.
Full textSchechtman, Gideon, and Nicole Tomczak-Jaegermann. "Polylog Dimensional Subspaces of $$\ell _\infty ^N$$." In Lecture Notes in Mathematics, 325–34. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-46762-3_15.
Full textPeleg, David, and Eilon Reshef. "Deterministic polylog approximation for minimum communication spanning trees." In Automata, Languages and Programming, 670–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0055092.
Full textAzarmehr, Amir, Soheil Behnezhad, and Mohammad Roghani. "Fully Dynamic Matching: -Approximation in Polylog Update Time." In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 3040–61. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2024. http://dx.doi.org/10.1137/1.9781611977912.109.
Full textRothblum, Guy N., and Ron D. Rothblum. "Batch Verification and Proofs of Proximity with Polylog Overhead." In Theory of Cryptography, 108–38. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-64378-2_5.
Full textKolman, Petr. "Approximating Spanning Tree Congestion on Graphs with Polylog Degree." In Lecture Notes in Computer Science, 497–508. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63021-7_38.
Full textHolm, Jacob, and Eva Rotenberg. "Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity." In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2378–97. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2020. http://dx.doi.org/10.1137/1.9781611975994.146.
Full textConference papers on the topic "Polylgot"
Roos, Stefanie, and Thorsten Strufe. "Provable Polylog Routing for Darknets." In 2012 32nd International Conference on Distributed Computing Systems Workshops (ICDCS Workshops). IEEE, 2012. http://dx.doi.org/10.1109/icdcsw.2012.24.
Full textChandra, Tushar Deepak. "Polylog randomized wait-free consensus." In the fifteenth annual ACM symposium. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/248052.248083.
Full textSaks, Michael, Aravind Srinivasan, and Shiyu Zhou. "Explicit dispersers with polylog degree." In the twenty-seventh annual ACM symposium. New York, New York, USA: ACM Press, 1995. http://dx.doi.org/10.1145/225058.225188.
Full textMeel, Kuldeep S., Aditya A. Shrotri, and Moshe Y. Vardi. "Not All FPRASs are Equal: Demystifying FPRASs for DNF-Counting (Extended Abstract)." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/865.
Full textHaeupler, Bernhard, Shyamal Patel, Antti Roeyskoe, Cliff Stein, and Goran Zuzic. "Polylog-Competitive Deterministic Local Routing and Scheduling." In STOC '24: 56th Annual ACM Symposium on Theory of Computing. New York, NY, USA: ACM, 2024. http://dx.doi.org/10.1145/3618260.3649678.
Full textBartal, Yair, Avrim Blum, Carl Burch, and Andrew Tomkins. "A polylog(n)-competitive algorithm for metrical task systems." In the twenty-ninth annual ACM symposium. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/258533.258667.
Full textChandra, Tushar Deepak, Prasad Jayanti, and King Tan. "A polylog time wait-free construction for closed objects." In the seventeenth annual ACM symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/277697.277753.
Full textFerrarotti, Flavio, Senen Gonzalez, Klaus-Dieter Schewe, and Jose Mariia Turull-Torres. "The Polylog-Time Hierarchy Captured by Restricted Second-Order Logic." In 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2018. http://dx.doi.org/10.1109/synasc.2018.00032.
Full textUchima, H., L. Torrealba, C. Huertas, M. Hombrados, M. Figa, R. Louvriex, S. Arjona, and X. Aldeguer. "ENDOSCOPIC FULL THICKNESS RESECTION IN THE RECTUM CLOSED WITH POLYLOOP AND CLIPS." In ESGE Days 2018 accepted abstracts. Georg Thieme Verlag KG, 2018. http://dx.doi.org/10.1055/s-0038-1637337.
Full textRäcke, Harald, Stefan Schmid, and Ruslan Zabrodin. "Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands." In SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3558481.3591097.
Full text