LEADER 01122nam a22002531i 4500 001 991002999649707536 005 20040507085324.0 008 040624s1929 hu a||||||||||||||||ita 035 $ab13009515-39ule_inst 035 $aARCHE-096719$9ExL 040 $aDip.to Beni Culturali$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 082 04$a945.675 100 1 $aDumitrescu, Vladimir$0207428 245 12$aL'età del ferro nel Piceno fino all'invasione dei Galli-Senoni /$cVladimir Dumitrescu 260 $aBucarest :$bTipografia del giornale Universul,$c1929 300 $a215 p., 9 c. di tav. :$bill. ;$c29 cm 500 $aSul front.: Tesi di dottorato alla Facoltà di Lettere e Filosofia dell'Università di Bucarest 651 4$aPiceno$xStoria antica 907 $a.b13009515$b02-04-14$c12-07-04 912 $a991002999649707536 945 $aLE001 AR VII 88 8$g1$i2001000125395$lle001$nC. 1$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i13620587$z12-07-04 996 $aEtà del ferro nel Piceno fino all'invasione dei Galli-Senoni$9282952 997 $aUNISALENTO 998 $ale001$b12-07-04$cm$da $e-$fita$ghu $h2$i1 LEADER 04377 am 2200757 n 450 001 9910496036503321 005 20200525 010 $a979-1-03-654777-5 024 7 $a10.4000/books.pulg.7792 035 $a(CKB)5590000000006018 035 $a(FrMaCLE)OB-pulg-7792 035 $a(oapen)https://directory.doabooks.org/handle/20.500.12854/86271 035 $a(PPN)251070484 035 $a(EXLCZ)995590000000006018 100 $a20201104j|||||||| ||| 0 101 0 $afre 135 $auu||||||m|||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aEnquête ouvrière et théorie critique $eEnjeux et figures de la centralité ouvrière dans l?Italie des années 1960 /$fAndrea Cavazzini 210 $aLiège $cPresses universitaires de Liège$d2020 215 $a1 online resource (170 p.) 225 1 $aPhilosophie 311 $a2-87562-025-8 330 $aSuite à la dissolution de la perspective marxiste et aux transformations néo-libérales du capitalisme à la fin des années 1970, la Classe ouvrière s?est éclipsée : après des décennies de déclin social et d?invisibilité politique, les ouvriers n?apparaissent plus aujourd?hui que comme les victimes de la crise, du chômage de masse et de conditions de vie souvent meurtrières. Mais la centralité politique et sociale de la Classe ouvrière a constitué un facteur décisif de l?histoire du xxe siècle. La Classe représentait à la fois un élément essentiel dans le fonctionnement de l?économie capitaliste et un principe d?antagonisme subjectif qui annonçait dans ses formes de vie la possibilité d?une organisation sociale différente. Cet ouvrage reconstruit un épisode significatif de l?histoire de la centralité ouvrière : la séquence politique des années 1960 en Italie. La Nouvelle Gauche italienne ? en particulier la revue-collectif Quaderni Rossi ? a produit une fusion originale entre l?enquête menée dans les usines comme pratique militante directe et la théorie critique du capitalisme moderne inspirée par Lukács et l?École de Francfort. Malgré sa brièveté, cette expérience fut décisive pour la longue saison italienne des luttes sociales : elle a réussi à articuler l?exigence d?ancrer la politique à la vie ordinaire des classes laborieuses, la tentative de surmonter la crise du mouvement ouvrier après la glaciation stalinienne et la confrontation avec les diagnostics philosophiques de la modernité élaborés par Hegel et Max Weber. À la fois intervention militante et production de connaissances, l?enquête est le fil conducteur qui permet de reconstruire cette conjoncture et ses enjeux historiques et philosophiques : elle rend visible l?émergence d?une subjectivité politique ouvrière en tant que point critique irréductible de la société capitaliste moderne. Reconstruire cette constellation signifie se remémorer la négation dialectique d?un ordre social devenu nature et destin. 606 $aPhilosophy 606 $aHistory 606 $athéorie critique 606 $acentralité ouvrière 606 $aNouvelle Gauche italienne 606 $aQuaderni Rossi 606 $aopéraïsme 606 $ahistoire des revues 606 $amarxisme occidental 606 $aenquête ouvrière 606 $aconscience de classe 606 $alutte des classes 610 $athéorie critique 610 $acentralité ouvrière 610 $aNouvelle Gauche italienne 610 $aQuaderni Rossi 610 $aopéraïsme 610 $ahistoire des revues 610 $amarxisme occidental 610 $aenquête ouvrière 610 $aconscience de classe 610 $alutte des classes 615 4$aPhilosophy 615 4$aHistory 615 4$athéorie critique 615 4$acentralité ouvrière 615 4$aNouvelle Gauche italienne 615 4$aQuaderni Rossi 615 4$aopéraïsme 615 4$ahistoire des revues 615 4$amarxisme occidental 615 4$aenquête ouvrière 615 4$aconscience de classe 615 4$alutte des classes 700 $aCavazzini$b Andrea$01290466 801 0$bFR-FrMaCLE 906 $aBOOK 912 $a9910496036503321 996 $aEnquête ouvrière et théorie critique$93037131 997 $aUNINA LEADER 08414nam 22008295 450 001 9910484926803321 005 20251226202521.0 010 $a3-642-04128-0 024 7 $a10.1007/978-3-642-04128-0 035 $a(CKB)1000000000798289 035 $a(SSID)ssj0000316173 035 $a(PQKBManifestationID)11261608 035 $a(PQKBTitleCode)TC0000316173 035 $a(PQKBWorkID)10263761 035 $a(PQKB)10579904 035 $a(DE-He213)978-3-642-04128-0 035 $a(MiAaPQ)EBC3064588 035 $a(PPN)139955356 035 $a(EXLCZ)991000000000798289 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms - ESA 2009 $e17th Annual European Symposium, Copenhagen, Denmark, September 7-9, Proceedings /$fedited by Amos Fiat, Peter Sanders 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XIX, 790 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5757 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-04127-2 320 $aIncludes bibliographical references and index. 327 $aInvited Talk -- Some Open Questions Related to Cuckoo Hashing -- Trees -- Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks -- Improved Approximation Algorithms for Label Cover Problems -- A Linear Time Algorithm for L(2,1)-Labeling of Trees -- Geometry I -- On Inducing Polygons and Related Problems -- Computing 3D Periodic Triangulations -- Cauchy?s Theorem for Orthogonal Polyhedra of Genus 0 -- Mathematical Programming -- Approximability of Sparse Integer Programs -- Iterative Rounding for Multi-Objective Optimization Problems -- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity -- Geometry II -- Constructing Delaunay Triangulations along Space-Filling Curves -- Piercing Translates and Homothets of a Convex Body -- Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs -- Algorithmic Game Theory I -- On Revenue Maximization in Second-Price Ad Auctions -- Clustering-Based Bidding Languages for Sponsored Search -- Altruism in Atomic Congestion Games -- Geometry III -- Geometric Spanners for Weighted Point Sets -- k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees -- Narrow-Shallow-Low-Light Trees with and without Steiner Points -- Algorithmic Game Theory II -- Bounded Budget Betweenness Centrality Game for Strategic Network Formations -- Exact and Approximate Equilibria for Optimal Group Network Formation -- On the Performance of Approximate Equilibria in Congestion Games -- Navigation and Routing -- Optimality and Competitiveness of Exploring Polygons by Mobile Robots -- Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links -- Dynamic vs. Oblivious Routing in Network Design -- Invited Talk -- Algorithms Meet Art, Puzzles, andMagic -- Graphs and Point Sets -- Polynomial-Time Algorithm for the Leafage of Chordal Graphs -- Breaking the O(m 2 n) Barrier for Minimum Cycle Bases -- Shape Fitting on Point Sets with Probability Distributions -- Bioinformatics -- An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract) -- Complete Parsimony Haplotype Inference Problem and Algorithms -- Linear-Time Recognition of Probe Interval Graphs -- Wireless Communications -- Wireless Scheduling with Power Control -- On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources -- Approximability of OFDMA Scheduling -- Flows, Matrices, Compression -- Maximum Flow in Directed Planar Graphs with Vertex Capacities -- A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication -- On Optimally Partitioning a Text to Improve Its Compression -- Scheduling -- An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling -- Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling -- Preemptive Online Scheduling with Reordering -- Streaming -- d-Dimensional Knapsack in the Streaming Model -- Sparse Cut Projections in Graph Streams -- Bipartite Graph Matchings in the Semi-streaming Model -- Online Algorithms -- The Oil Searching Problem -- Hyperbolic Dovetailing -- Bluetooth and Dial a Ride -- On the Expansion and Diameter of Bluetooth-Like Topologies -- Minimum Makespan Multi-vehicle Dial-a-Ride -- Invited Talk -- Google?s Auction for TV Ads -- Decomposition and Covering -- Inclusion/Exclusion Meets Measure and Conquer -- Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution -- Counting Paths and Packings in Halves -- Algorithm Engineering -- Accelerating Multi-modal Route Planning by Access-Nodes.-Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation -- Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem -- Parameterized Algorithms I -- Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth -- Kernel Bounds for Disjoint Cycles and Disjoint Paths -- Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem -- Data Structures -- Rank-Pairing Heaps -- 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit -- Hash, Displace, and Compress -- Parameterized Algorithms II -- Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels -- Contraction Bidimensionality: The Accurate Picture -- Minimizing Movement: Fixed-Parameter Tractability -- Hashing and Lowest Common Ancestor -- Storing a Compressed Function with Constant Time Access -- Experimental Variations of a Theoretically Good Retrieval Data Structure -- Short Labels for Lowest Common Ancestors in Trees -- Best Paper Awards -- Disproof of the Neighborhood Conjecture with Implications to SAT -- Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. 330 $aThis book constitutes the refereed proceedings of the 17th Annual European Symposium on Algorithms, ESA 2009, held in Copenhagen, Denmark, in September 2009 in the context of the combined conference ALGO 2009. The 67 revised full papers presented together with 3 invited lectures were carefully reviewed and selected: 56 papers out of 222 submissions for the design and analysis track and 10 out of 36 submissions in the engineering and applications track. The papers are organized in topical sections on trees, geometry, mathematical programming, algorithmic game theory, navigation and routing, graphs and point sets, bioinformatics, wireless communiations, flows, matrices, compression, scheduling, streaming, online algorithms, bluetooth and dial a ride, decomposition and covering, algorithm engineering, parameterized algorithms, data structures, and hashing and lowest common ancestor. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5757 606 $aComputer programming 606 $aAlgorithms 606 $aInformation retrieval 606 $aComputer architecture 606 $aArtificial intelligence$xData processing 606 $aComputer science$xMathematics 606 $aComputer networks 606 $aProgramming Techniques 606 $aAlgorithms 606 $aData Storage Representation 606 $aData Science 606 $aMathematics of Computing 606 $aComputer Communication Networks 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aInformation retrieval. 615 0$aComputer architecture. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer science$xMathematics. 615 0$aComputer networks. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aData Storage Representation. 615 24$aData Science. 615 24$aMathematics of Computing. 615 24$aComputer Communication Networks. 676 $a005.11 701 $aFiat$b Amos$01754567 701 $aSanders$b Peter$0244577 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484926803321 996 $aAlgorithms - ESA 2009$94191000 997 $aUNINA