02829nam0 22006253i 450 VAN024910920230530094329.176N978303054533820220805d2020 |0itac50 baengCH|||| |||||Explorations in Complex FunctionsRichard Beals, Roderick S. C. WongChamSpringer2020xvi, 353 p.ill.24 cm001VAN00235792001 Graduate texts in mathematics210 New York [etc.]Springer287VAN0249110Explorations in Complex Functions290249446-XXFunctional analysis [MSC 2020]VANC019764MF42-XXHarmonic analysis on Euclidean spaces [MSC 2020]VANC019851MF30-XXFunctions of a complex variable [MSC 2020]VANC020785MF30CxxGeometric function theory [MSC 2020]VANC021375MF30DxxEntire and meromorphic functions of one complex variable, and related topics [MSC 2020]VANC022583MF33-XXSpecial functions [MSC 2020]VANC022590MF30BxxSeries expansions of functions of one complex variable [MSC 2020]VANC022979MF30AxxGeneral properties of functions of one complex variable [MSC 2020]VANC028784MFApplications of the SchwarzianKW:KAutomorphic FunctionsKW:KBeta functionKW:KCauchy transformKW:KComplex AnalysisKW:KConformal mappingsKW:KElliptic functionsKW:KEntire functionsKW:KFourier transformKW:KGamma FunctionKW:KHilbert transformKW:KHyperbolic geometryKW:KL-functionsKW:KLinear fractional transformations. Harmonic functionsKW:KNevanlinna theoryKW:KRiemann hypothesisKW:KSchwarzian derivativeKW:KZeta functionKW:KCHChamVANL001889BealsRichardVANV04118627941WongRoderick S. C.VANV2038061252016Springer <editore>VANV108073650ITSOL20240614RICAhttp://doi.org/10.1007/978-3-030-54533-8E-book – Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o ShibbolethBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICAIT-CE0120VAN08NVAN0249109BIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA08CONS e-book 4649 08eMF4649 20220805 Explorations in Complex Functions2902494UNICAMPANIA04989nam 22008055 450 991014362790332120200706074717.03-540-44688-510.1007/3-540-44688-5(CKB)1000000000211550(SSID)ssj0000321159(PQKBManifestationID)11246886(PQKBTitleCode)TC0000321159(PQKBWorkID)10263076(PQKB)10971905(DE-He213)978-3-540-44688-0(MiAaPQ)EBC3072706(PPN)155237101(EXLCZ)99100000000021155020121227d2001 u| 0engurnn|008mamaatxtccrAlgorithm Engineering 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001 Proceedings /edited by Gerd Stoelting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela1st ed. 2001.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2001.1 online resource (X, 202 p.) Lecture Notes in Computer Science,0302-9743 ;2141Bibliographic Level Mode of Issuance: Monograph3-540-42500-4 Includes bibliographical references at the end of each chapters and index.Compact DFA Representation for Fast Regular Expression Search -- The Max-Shift Algorithm for Approximate String Matching -- Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance -- Experiences with the Design and Implementation of Space-Efficient Deques -- Designing and Implementing a General Purpose Halfedge Data Structure -- Optimised Predecessor Data Structures for Internal Memory -- An Adaptable and Extensible Geometry Kernel -- Efficient Resource Allocation with Noisy Functions -- Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem -- Exploiting Partial Knowledge of Satisfying Assignments -- Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture -- An Experimental Study of Data Migration Algorithms -- An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks -- Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry -- Pareto Shortest Paths is Often Feasible in Practice.This book constitutes the refereed proceedings of the 5th Workshop on Algorithm Engineering, WAE 2001, held in Aarhus, Denmark, in August 2001. The 15 revised full papers presented were carefully reviewed and selected from 25 submissions. Among the topics addressed are implementation, experimental testing, and fine-tuning of discrete algorithms; novel use of discrete algorithms in other disciplines; empirical research on algorithms and data structures; and methodological issues regarding the process of converting user requirements into efficient algorithmic solutions and implemenations.Lecture Notes in Computer Science,0302-9743 ;2141ComputersComputer programmingData structures (Computer science)AlgorithmsComputer science—MathematicsTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Programming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Data Structures and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15009Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Computers.Computer programming.Data structures (Computer science)Algorithms.Computer science—Mathematics.Theory of Computation.Programming Techniques.Data Structures and Information Theory.Algorithm Analysis and Problem Complexity.Discrete Mathematics in Computer Science.Data Structures.005.1Brodal Gerd Stoeltingedthttp://id.loc.gov/vocabulary/relators/edtFrigioni Danieleedthttp://id.loc.gov/vocabulary/relators/edtMarchetti-Spaccamela Albertoedthttp://id.loc.gov/vocabulary/relators/edtWAE 2001MiAaPQMiAaPQMiAaPQBOOK9910143627903321Algorithm engineering1980326UNINA