LEADER 04219nam 22007215 450 001 996465916303316 005 20230406043448.0 010 $a3-642-11269-2 024 7 $a10.1007/978-3-642-11269-0 035 $a(CKB)1000000000812689 035 $a(SSID)ssj0000355582 035 $a(PQKBManifestationID)11256494 035 $a(PQKBTitleCode)TC0000355582 035 $a(PQKBWorkID)10320801 035 $a(PQKB)11124403 035 $a(DE-He213)978-3-642-11269-0 035 $a(MiAaPQ)EBC3064904 035 $a(PPN)139963073 035 $a(EXLCZ)991000000000812689 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aParameterized and Exact Computation$b[electronic resource] $e4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers /$fedited by Jianer Chen, Fedor V. Fomin 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (X, 335 p. 26 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5917 300 $aIncludes index. 311 $a3-642-11268-4 327 $aBalanced Hashing, Color Coding and Approximate Counting -- Kernelization: New Upper and Lower Bound Techniques -- A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams -- Planar Capacitated Dominating Set Is W[1]-Hard -- Boolean-Width of Graphs -- The Complexity of Satisfiability of Small Depth Circuits -- On Finding Directed Trees with Many Leaves -- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms -- Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover -- What Makes Equitable Connected Partition Easy -- Improved Induced Matchings in Sparse Graphs -- Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs -- An Exact Algorithm for the Maximum Leaf Spanning Tree Problem -- An Exponential Time 2-Approximation Algorithm for Bandwidth -- On Digraph Width Measures in Parameterized Algorithmics -- The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension -- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms -- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs -- A Probabilistic Approach to Problems Parameterized above or below Tight Bounds -- Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor -- Partitioning into Sets of Bounded Cardinality -- Two Edge Modification Problems without Polynomial Kernels -- On the Directed Degree-Preserving Spanning Tree Problem -- Even Faster Algorithm for Set Splitting! -- Stable Assignment with Couples: Parameterized Complexity and Local Search -- Improved Parameterized Algorithms for the Kemeny Aggregation Problem -- Computing Pathwidth Faster Than 2 n . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5917 606 $aComputer programming 606 $aDiscrete mathematics 606 $aComputer science?Mathematics 606 $aAlgorithms 606 $aProgramming Techniques 606 $aDiscrete Mathematics 606 $aMathematics of Computing 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer programming. 615 0$aDiscrete mathematics. 615 0$aComputer science?Mathematics. 615 0$aAlgorithms. 615 14$aProgramming Techniques. 615 24$aDiscrete Mathematics. 615 24$aMathematics of Computing. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 676 $a519.544 686 $a004$2sdnb 686 $aDAT 517f$2stub 686 $aSS 4800$2rvk 702 $aChen$b Jianer$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFomin$b Fedor V$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aIWPEC 2009 906 $aBOOK 912 $a996465916303316 996 $aParameterized and Exact Computation$9772030 997 $aUNISA LEADER 03664nam 2200721 a 450 001 9910785376503321 005 20230725025439.0 010 $a1-282-88505-7 010 $a9786612885051 010 $a3-11-023440-8 024 7 $a10.1515/9783110234404 035 $a(CKB)2670000000055397 035 $a(EBL)605980 035 $a(OCoLC)689997553 035 $a(SSID)ssj0000413605 035 $a(PQKBManifestationID)12190919 035 $a(PQKBTitleCode)TC0000413605 035 $a(PQKBWorkID)10383761 035 $a(PQKB)11500988 035 $a(MiAaPQ)EBC605980 035 $a(DE-B1597)113884 035 $a(OCoLC)1002243494 035 $a(OCoLC)1004878478 035 $a(OCoLC)1011446905 035 $a(OCoLC)690115475 035 $a(OCoLC)987936827 035 $a(OCoLC)992544555 035 $a(OCoLC)999354866 035 $a(DE-B1597)9783110234404 035 $a(Au-PeEL)EBL605980 035 $a(CaPaEBR)ebr10424422 035 $a(CaONFJC)MIL288505 035 $a(EXLCZ)992670000000055397 100 $a20101119d2010 uy 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aCase and agreement from fringe to core$b[electronic resource] $ea minimalist approach /$fStefan Keine 210 $aBerlin $cDe Gruyter$d2010 215 $a1 online resource (240 p.) 225 1 $aLinguistische Arbeiten,$x0344-6727 ;$v536 300 $aDescription based upon print version of record. 311 $a3-11-023439-4 320 $aIncludes bibliographical references and index. 327 $t Frontmatter -- $tContents -- $tPreface -- $tAbbreviations -- $t1. Introduction -- $t2. Theoretical Background -- $t3. The Input to Agree -- $t4. Eccentric Agreement -- $t5. Icelandic Nominative Objects -- $t6. Global Case Splits -- $t7. ?-Impoverishment -- $t8. Concluding Remarks -- $t Backmatter 330 $aThis book explores the view that impoverishment and Agree operations are part of a single grammatical component. The architecture set forth here gives rise tocomplex but highly systematic interactions between the two operations. This interaction is shown to provide a unified and general account of apparentlydiverse and unrelated intances of eccentric argument encoding that so far haveremained elusive to a unified theoretical account. The proposed view of the grammatical architecture achieves an integration of these phenomena withinbetter-studied languages and thus gives rise to a more general theory of caseand agreement phenomena. The empirical evidence on the basis of which the proposal is developed drawsfrom a wide range of typologically non-related languages, including Basque, Hindi, Icelandic, Itelmen, Marathi, Nez Perce, Niuean, Punjabi, Sahaptin, Selayarese, Yukaghir, and Yurok . The proposal has far-reaching consequences for the study of grammatical architecture, linguistic interfaces, derivational locality in apparently non-local dependencies and the role of functional considerations in formal approaches tothe human language faculty. 410 0$aLinguistische Arbeiten (Max Niemeyer Verlag) ;$v536. 606 $aGrammar, Comparative and general$xCase 606 $aGrammar, Comparative and general$xAgreement 615 0$aGrammar, Comparative and general$xCase. 615 0$aGrammar, Comparative and general$xAgreement. 676 $a415 686 $aET 660$2rvk 700 $aKeine$b Stefan$01506042 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910785376503321 996 $aCase and agreement from fringe to core$93736071 997 $aUNINA