Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
L'apprentissage de la lecture : Perspectives comparatives / / Mohamed Nouri Romdhane, Jean Emile Gombert, Michèle Belajouza
| L'apprentissage de la lecture : Perspectives comparatives / / Mohamed Nouri Romdhane, Jean Emile Gombert, Michèle Belajouza |
| Autore | Alegria J |
| Pubbl/distr/stampa | Rennes, : Presses universitaires de Rennes, 2018 |
| Descrizione fisica | 1 online resource (387 p.) |
| Altri autori (Persone) |
Alvarez-CienfuegosCarmen
AmmarMohamed ArmandFrançoise BaccoucheTaieb BastienClaude Bastien-ToniazzoMireille BaudetValérie BelajouzaMichèle BelkadhiAlia Maaouia BoukadidaNahed BruckertJean Pierre CarrilloMarisol CarrilloS CitolerSilvia Defior DemontElisabeth DerguiniMeriem de KoninckZita DoignonNadège EcalleJean EmeElsa FadhelSlah Eddine Ben GombertJean Emile HabibMichel HaroCarol JaffréJean-Pierre JourdainChristine LeteBernard MagnanAnnie MarinJ MekidecheTchirine MoustyPh NajemAida ProstVéronique ReyVéronique RomdhaneMohamed Nouri RouetJean-François SabaterCarine Sanguin-BruckertChristine ThomasKarine TønnessenFinn Egil TorresLucia Herrera ZagarDaniel ZiarkoHélène Nouri RomdhaneMohamed |
| Soggetto topico |
Education & Educational Research
Language & Linguistics lecture langue arabe apprentissage |
| Soggetto non controllato |
langue arabe
lecture apprentissage |
| ISBN | 2-7535-6405-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | fre |
| Record Nr. | UNINA-9910313028203321 |
Alegria J
|
||
| Rennes, : Presses universitaires de Rennes, 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
La cognition réparée ? : Perturbations et récupérations des fonctions cognitives / / Roland Jouvent, Georges Chapouthier
| La cognition réparée ? : Perturbations et récupérations des fonctions cognitives / / Roland Jouvent, Georges Chapouthier |
| Autore | Abry Christian |
| Pubbl/distr/stampa | Paris, : Éditions de la Maison des sciences de l’homme, 2019 |
| Descrizione fisica | 1 online resource (222 p.) |
| Altri autori (Persone) |
BaciuMonica
BaconElisabeth BarrouilletPierre BoucartMuriel CamosValérie CarnicellaSebastien ChapouthierGeorges DeruelleChristine Fabre-ThorpeMichèle GombertJean-Émile HabibMichel HausbergerMartine JouventRoland LebeauJacques Metz-LutzMarie-Noëlle OberlingPhilippe PerrierPascal SavariauxChristophe SegebarthChristoph SerniclaesWilly Sprenger-CharollesLiliane ThibautFlorence VilainCoriandre |
| Soggetto topico |
Cognition disorders - Treatment
Cognitive neuroscience |
| Soggetto non controllato |
neuroscience cognitive
trouble de la cognition thérapie |
| ISBN | 2-7351-1914-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | fre |
| Record Nr. | UNINA-9910353339903321 |
|
Abry Christian
|
||
| Paris, : Éditions de la Maison des sciences de l’homme, 2019 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers / / edited by Christophe Paul, Michel Habib
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers / / edited by Christophe Paul, Michel Habib |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 353 p.) |
| Disciplina | 004.015115 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Geometry Algorithms Artificial intelligence—Data processing Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Data Science |
| ISBN |
1-280-38546-4
9786613563385 3-642-11409-1 |
| Classificazione |
DAT 537f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph-Theoretic Solutions to Computational Geometry Problems -- Algorithms for Classes of Graphs with Bounded Expansion -- A Graph Polynomial Arising from Community Structure (Extended Abstract) -- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs -- Maximum Series-Parallel Subgraph -- Low-Port Tree Representations -- Fully Dynamic Representations of Interval Graphs -- The Parameterized Complexity of Some Minimum Label Problems -- Exact and Parameterized Algorithms for Max Internal Spanning Tree -- An Exact Algorithm for Minimum Distortion Embedding -- Sub-coloring and Hypo-coloring Interval Graphs -- Parameterized Complexity of Generalized Domination Problems -- Connected Feedback Vertex Set in Planar Graphs -- Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) -- On Module-Composed Graphs -- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees -- The k-Disjoint Paths Problem on Chordal Graphs -- Local Algorithms for Edge Colorings in UDGs -- Directed Rank-Width and Displit Decomposition -- An Algorithmic Study of Switch Graphs -- Hardness Results and Efficient Algorithms for Graph Powers -- Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph -- Injective Oriented Colourings -- Chordal Digraphs -- A New Intersection Model and Improved Algorithms for Tolerance Graphs -- Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes -- Distance d-Domination Games -- Cycles, Paths, Connectivity and Diameter in Distance Graphs -- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) -- Finding Induced Paths of Given Parity in Claw-Free Graphs. |
| Record Nr. | UNISA-996465915003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2003 [[electronic resource] ] : 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings / / edited by Helmut Alt, Michel Habib
| STACS 2003 [[electronic resource] ] : 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings / / edited by Helmut Alt, Michel Habib |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XVIII, 706 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer science Data structures (Computer science) Computer science—Mathematics Theory of Computation Computer Science, general Data Structures Discrete Mathematics in Computer Science |
| ISBN | 3-540-36494-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Logic as a Query Language: From Frege to XML -- How Does Computer Science Change Molecular Biology? -- Contributed Papers -- Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer -- Rectangle Visibility Graphs: Characterization, Construction, and Compaction -- Approximating Geometric Bottleneck Shortest Paths -- Optimization in Arrangements -- Complete Classifications for the Communication Complexity of Regular Languages -- The Commutation with Codes and Ternary Sets of Words -- On the Confluence of Linear Shallow Term Rewrite Systems -- Wadge Degrees of ?-Languages of Deterministic Turing Machines -- Faster Deterministic Broadcasting in Ad Hoc Radio Networks -- Private Computations in Networks: Topology versus Randomness -- On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements -- Lattice Reduction by Random Sampling and Birthday Methods -- On the Ultimate Complexity of Factorials -- On the Effective Jordan Decomposability -- Fast Algorithms for Extended Regular Expression Matching and Searching -- Algorithms for Transposition Invariant String Matching (Extended Abstract) -- On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets -- Some Results on Derandomization -- On the Representation of Boolean Predicates of the Diffie-Hellman Function -- Quantum Circuits with Unbounded Fan-out -- Analysis of the Harmonic Algorithm for Three Servers -- Non-clairvoyant Scheduling for Minimizing Mean Slowdown -- Space Efficient Hash Tables with Worst Case Constant Access Time -- Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure -- Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs -- Randomness versus Nondeterminism for Read-Once and Read-k Branching Programs -- Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids -- Algebraic Characterizations of Small Classes of Boolean Functions -- On the Difficulty of Some Shortest Path Problems -- Representing Graph Metrics with Fewest Edges -- Computing Shortest Paths with Uncertainty -- Solving Order Constraints in Logarithmic Space -- The Inversion Problem for Computable Linear Operators -- Algebras of Minimal Rank over Arbitrary Fields -- Evolutionary Algorithms and the Maximum Matching Problem -- Alternative Algorithms for Counting All Matchings in Graphs -- Strong Stability in the Hospitals/Residents Problem -- The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete -- Decidable Theories of Cayley-Graphs -- The Complexity of Resolution with Generalized Symmetry Rules -- Colouring Random Graphs in Expected Polynomial Time -- An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation -- Finding Large Independent Sets in Polynomial Expected Time -- Distributed Soft Path Coloring -- Competing Provers Yield Improved Karp-Lipton Collapse Results -- One Bit of Advice -- Strong Reductions and Immunity for Exponential Time -- The Complexity of Membership Problems for Circuits over Sets of Natural Numbers -- Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem -- Cake-Cutting Is Not a Piece of Cake -- The Price of Truth: Frugality in Truthful Mechanisms -- Untameable Timed Automata! -- The Intrinsic Universality Problem of One-Dimensional Cellular Automata -- On Sand Automata -- Adaptive Sorting and the Information Theoretic Lower Bound -- A Discrete Subexponential Algorithm for Parity Games -- Cryptographically Sound and Machine-Assisted Verification of Security Protocols -- Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. |
| Record Nr. | UNISA-996465475903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2003 : 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings / / edited by Helmut Alt, Michel Habib
| STACS 2003 : 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings / / edited by Helmut Alt, Michel Habib |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XVIII, 706 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer science Data structures (Computer science) Computer science—Mathematics Theory of Computation Computer Science, general Data Structures Discrete Mathematics in Computer Science |
| ISBN | 3-540-36494-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Logic as a Query Language: From Frege to XML -- How Does Computer Science Change Molecular Biology? -- Contributed Papers -- Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer -- Rectangle Visibility Graphs: Characterization, Construction, and Compaction -- Approximating Geometric Bottleneck Shortest Paths -- Optimization in Arrangements -- Complete Classifications for the Communication Complexity of Regular Languages -- The Commutation with Codes and Ternary Sets of Words -- On the Confluence of Linear Shallow Term Rewrite Systems -- Wadge Degrees of ?-Languages of Deterministic Turing Machines -- Faster Deterministic Broadcasting in Ad Hoc Radio Networks -- Private Computations in Networks: Topology versus Randomness -- On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements -- Lattice Reduction by Random Sampling and Birthday Methods -- On the Ultimate Complexity of Factorials -- On the Effective Jordan Decomposability -- Fast Algorithms for Extended Regular Expression Matching and Searching -- Algorithms for Transposition Invariant String Matching (Extended Abstract) -- On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets -- Some Results on Derandomization -- On the Representation of Boolean Predicates of the Diffie-Hellman Function -- Quantum Circuits with Unbounded Fan-out -- Analysis of the Harmonic Algorithm for Three Servers -- Non-clairvoyant Scheduling for Minimizing Mean Slowdown -- Space Efficient Hash Tables with Worst Case Constant Access Time -- Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure -- Complexity Theoretical Results on Nondeterministic Graph-Driven Read-Once Branching Programs -- Randomness versus Nondeterminism for Read-Once and Read-k Branching Programs -- Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids -- Algebraic Characterizations of Small Classes of Boolean Functions -- On the Difficulty of Some Shortest Path Problems -- Representing Graph Metrics with Fewest Edges -- Computing Shortest Paths with Uncertainty -- Solving Order Constraints in Logarithmic Space -- The Inversion Problem for Computable Linear Operators -- Algebras of Minimal Rank over Arbitrary Fields -- Evolutionary Algorithms and the Maximum Matching Problem -- Alternative Algorithms for Counting All Matchings in Graphs -- Strong Stability in the Hospitals/Residents Problem -- The Inference Problem for Propositional Circumscription of Afine Formulas Is coNP-Complete -- Decidable Theories of Cayley-Graphs -- The Complexity of Resolution with Generalized Symmetry Rules -- Colouring Random Graphs in Expected Polynomial Time -- An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation -- Finding Large Independent Sets in Polynomial Expected Time -- Distributed Soft Path Coloring -- Competing Provers Yield Improved Karp-Lipton Collapse Results -- One Bit of Advice -- Strong Reductions and Immunity for Exponential Time -- The Complexity of Membership Problems for Circuits over Sets of Natural Numbers -- Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem -- Cake-Cutting Is Not a Piece of Cake -- The Price of Truth: Frugality in Truthful Mechanisms -- Untameable Timed Automata! -- The Intrinsic Universality Problem of One-Dimensional Cellular Automata -- On Sand Automata -- Adaptive Sorting and the Information Theoretic Lower Bound -- A Discrete Subexponential Algorithm for Parity Games -- Cryptographically Sound and Machine-Assisted Verification of Security Protocols -- Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic. |
| Record Nr. | UNINA-9910143878203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STACS 2004 [[electronic resource] ] : 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings / / edited by Volker Diekert, Michel Habib
| STACS 2004 [[electronic resource] ] : 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings / / edited by Volker Diekert, Michel Habib |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XVI, 660 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Data structures (Computer science) Algorithms Computer logic Mathematical logic Theory of Computation Computation by Abstract Devices Data Structures Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN |
1-280-30707-2
9786610307074 3-540-24749-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Approximation Schemes for Metric Clustering Problems -- Positional Determinacy of Infinite Games -- Structural Complexity (I) -- Individual Communication Complexity -- The Complexity of Satisfiability Problems over Finite Lattices -- Constant Width Planar Computation Characterizes ACC0 -- Graph Algorithms (I) -- A Simple and Fast Approach for Solving Problems on Planar Graphs -- Sum-Multicoloring on Paths -- Matching Algorithms Are Fast in Sparse Random Graphs -- Quantum Computations -- Algebraic Results on Quantum Automata -- Quantum Identification of Boolean Oracles -- Pattern Inference and Statistics -- Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models -- A Discontinuity in Pattern Inference -- Satisfiability – Constraint Satisfaction Problem -- Algorithms for SAT Based on Search in Hamming Balls -- Identifying Efficiently Solvable Cases of Max CSP -- The Complexity of Boolean Constraint Isomorphism -- Scheduling (I) -- On Minimizing the Total Weighted Tardiness on a Single Machine -- Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs -- Optimal and Online Preemptive Scheduling on Uniformly Related Machines -- Algorithms -- Parallel Prefetching and Caching Is Hard -- Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem -- Approximation Algorithms for Minimizing Average Distortion -- Networks (I) -- Digraphs Exploration with Little Memory -- Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks -- An Algorithmic View on OVSF Code Assignment -- Automata Theory and Words -- The Syntactic Graph of a Sofic Shift -- Periodicity and Unbordered Words -- Desert Automata and the Finite Substitution Problem -- Structural Complexity (II) -- Satisfiability Problems Complete for Deterministic Logarithmic Space -- A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number -- The Minimal Logically-Defined NP-Complete Problem -- Path Algorithms -- Solving the 2-Disjoint Paths Problem in Nearly Linear Time -- Simpler Computation of Single-Source Shortest Paths in Linear Average Time -- Cryptography -- Lattices with Many Cycles Are Dense -- Automata-Based Analysis of Recursive Cryptographic Protocols -- Networks (II) -- On Minimum Circular Arrangement -- Integral Symmetric 2-Commodity Flows -- Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks -- Logic and Formal Languages -- On the Expressiveness of Deterministic Transducers over Infinite Trees -- Definability and Regularity in Automatic Structures -- Active Context-Free Games -- Graphs Algorithms (II) -- Worst Case Performance of an Approximation Algorithm for Asymmetric TSP -- On Visibility Representation of Plane Graphs -- Topology Matters: Smoothed Competitiveness of Metrical Task Systems -- Game Theory and Complexity -- A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees -- The Plurality Problem with Three Colors -- A Measured Collapse of the Modal ?-Calculus Alternation Hierarchy -- Networks (III) -- An Information Theoretic Lower Bound for Broadcasting in Radio Networks -- A New Model for Selfish Routing -- Broadcast in the Rendezvous Model -- Structural Complexity (III) -- Time-Space Tradeoff in Derandomizing Probabilistic Logspace -- What Can be Efficiently Reduced to the K-Random Strings? -- Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms -- Scheduling (II) -- Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines -- The Expected Competitive Ratio for Weighted Completion Time Scheduling -- Algorithmic Information -- Effective Strong Dimension in Algorithmic Information and Computational Complexity -- A Lower Bound on the Competitive Ratio of Truthful Auctions -- Errata to STACS 2003 -- Errata to Analysis of the Harmonic Algorithm for Three Servers. |
| Record Nr. | UNISA-996465539603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2004 : 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings / / edited by Volker Diekert, Michel Habib
| STACS 2004 : 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings / / edited by Volker Diekert, Michel Habib |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XVI, 660 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Artificial intelligence - Data processing Algorithms Machine theory Theory of Computation Data Science Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
| ISBN |
1-280-30707-2
9786610307074 3-540-24749-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Approximation Schemes for Metric Clustering Problems -- Positional Determinacy of Infinite Games -- Structural Complexity (I) -- Individual Communication Complexity -- The Complexity of Satisfiability Problems over Finite Lattices -- Constant Width Planar Computation Characterizes ACC0 -- Graph Algorithms (I) -- A Simple and Fast Approach for Solving Problems on Planar Graphs -- Sum-Multicoloring on Paths -- Matching Algorithms Are Fast in Sparse Random Graphs -- Quantum Computations -- Algebraic Results on Quantum Automata -- Quantum Identification of Boolean Oracles -- Pattern Inference and Statistics -- Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models -- A Discontinuity in Pattern Inference -- Satisfiability – Constraint Satisfaction Problem -- Algorithms for SAT Based on Search in Hamming Balls -- Identifying Efficiently Solvable Cases of Max CSP -- The Complexity of Boolean Constraint Isomorphism -- Scheduling (I) -- On Minimizing the Total Weighted Tardiness on a Single Machine -- Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs -- Optimal and Online Preemptive Scheduling on Uniformly Related Machines -- Algorithms -- Parallel Prefetching and Caching Is Hard -- Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem -- Approximation Algorithms for Minimizing Average Distortion -- Networks (I) -- Digraphs Exploration with Little Memory -- Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks -- An Algorithmic View on OVSF Code Assignment -- Automata Theory and Words -- The Syntactic Graph of a Sofic Shift -- Periodicity and Unbordered Words -- Desert Automata and the Finite Substitution Problem -- Structural Complexity (II) -- Satisfiability Problems Complete for Deterministic Logarithmic Space -- A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number -- The Minimal Logically-Defined NP-Complete Problem -- Path Algorithms -- Solving the 2-Disjoint Paths Problem in Nearly Linear Time -- Simpler Computation of Single-Source Shortest Paths in Linear Average Time -- Cryptography -- Lattices with Many Cycles Are Dense -- Automata-Based Analysis of Recursive Cryptographic Protocols -- Networks (II) -- On Minimum Circular Arrangement -- Integral Symmetric 2-Commodity Flows -- Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks -- Logic and Formal Languages -- On the Expressiveness of Deterministic Transducers over Infinite Trees -- Definability and Regularity in Automatic Structures -- Active Context-Free Games -- Graphs Algorithms (II) -- Worst Case Performance of an Approximation Algorithm for Asymmetric TSP -- On Visibility Representation of Plane Graphs -- Topology Matters: Smoothed Competitiveness of Metrical Task Systems -- Game Theory and Complexity -- A Randomized Competitive Algorithm for Evaluating Priced AND/OR Trees -- The Plurality Problem with Three Colors -- A Measured Collapse of the Modal ?-Calculus Alternation Hierarchy -- Networks (III) -- An Information Theoretic Lower Bound for Broadcasting in Radio Networks -- A New Model for Selfish Routing -- Broadcast in the Rendezvous Model -- Structural Complexity (III) -- Time-Space Tradeoff in Derandomizing Probabilistic Logspace -- What Can be Efficiently Reduced to the K-Random Strings? -- Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms -- Scheduling (II) -- Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines -- The Expected Competitive Ratio for Weighted Completion Time Scheduling -- Algorithmic Information -- Effective Strong Dimension in Algorithmic Information and Computational Complexity -- A Lower Bound on the Competitive Ratio of Truthful Auctions -- Errata to STACS 2003 -- Errata to Analysis of the Harmonic Algorithm for Three Servers. |
| Record Nr. | UNINA-9910144204903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||