|
|
|
|
| LEADER |
07621cam a22009612 4500 |
| 001 |
0-1649435339 |
| 003 |
DE-627 |
| 005 |
20240122105318.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
100527s2010 gw |||||o 00| ||eng c |
| 020 |
|
|
|a 9783642122002
|9 978-3-642-12200-2
|
| 024 |
7 |
|
|a 10.1007/978-3-642-12200-2
|2 doi
|
| 035 |
|
|
|a (DE-627)1649435339
|
| 035 |
|
|
|a (DE-576)323615384
|
| 035 |
|
|
|a (DE-599)BSZ323615384
|
| 035 |
|
|
|a (OCoLC)700000366
|
| 035 |
|
|
|a (OCoLC)845760678
|
| 035 |
|
|
|a (ZBM)1185.68011
|
| 035 |
|
|
|a (DE-He213)978-3-642-12200-2
|
| 035 |
|
|
|a (EBP)040518922
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 044 |
|
|
|c XA-DE
|
| 050 |
|
0 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 084 |
|
|
|a SS 4800
|2 rvk
|0 (DE-625)rvk/143528:
|
| 084 |
|
|
|a *68-06
|2 msc
|
| 084 |
|
|
|a 00B25
|2 msc
|
| 084 |
|
|
|a 54.10
|2 bkl
|
| 100 |
1 |
|
|a López-Ortiz, Alejandro
|0 (DE-627)125945794X
|0 (DE-576)189457945
|4 aut
|
| 245 |
1 |
0 |
|a LATIN 2010: Theoretical Informatics
|b 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings
|c edited by Alejandro López-Ortiz
|
| 264 |
|
1 |
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2010
|
| 300 |
|
|
|a Online-Ressource (XV, 706p. 143 illus, digital)
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a Computermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a Online-Ressource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science
|v 6034
|
| 490 |
0 |
|
|a SpringerLink
|a Bücher
|
| 520 |
|
|
|a Continuous and Discrete Methods in Computer Science -- Colorful Strips -- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions -- Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set -- Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines -- Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width -- Average Parameterization and Partial Kernelization for Computing Medians -- Sharp Separation and Applications to Exact and Parameterized Algorithms -- Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight -- The Language Theory of Bounded Context-Switching -- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling -- Packet Routing on the Grid -- Faithful Representations of Graphs by Islands in the Extended Grid -- The I/O Complexity of Sparse Matrix Dense Matrix Multiplication -- Sparse Recovery Using Sparse Random Matrices -- Optimal Succinctness for Range Minimum Queries -- Compact Rich-Functional Binary Relation Representations -- Radix Cross-Sections for Length Morphisms -- Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata -- Quotient Complexity of Ideal Languages -- Complexity of Operations on Cofinite Languages -- Fast Set Intersection and Two-Patterns Matching -- Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields -- A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication -- Modelling the LLL Algorithm by Sandpiles -- Communication-Efficient Construction of the Plane Localized Delaunay Graph -- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization -- Randomised Broadcasting: Memory vs. Randomness -- Limit Theorems for Random MAX-2-XORSAT -- On Quadratic Threshold CSPs -- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming -- Finding the Best CAFE Is NP-Hard -- The Size and Depth of Layered Boolean Circuits -- Lipschitz Unimodal and Isotonic Regression on Paths and Trees -- Ambiguity and Deficiency in Costas Arrays and APN Permutations -- Iterated Shared Memory Models -- Optimal Polygonal Representation of Planar Graphs -- Minimum-Perimeter Intersecting Polygons -- Finding the Smallest Gap between Sums of Square Roots -- Matching Points with Things -- Homotopic Rectilinear Routing with Few Links and Thick Edges -- Tilings Robust to Errors -- Visiting a Sequence of Points with a Bevel-Tip Needle -- Euclidean Prize-Collecting Steiner Forest -- Prize-Collecting Steiner Networks via Iterative Rounding -- Kernelization through Tidying -- Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials -- The Power of Fair Pricing Mechanisms -- Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization -- Some Observations on Holographic Algorithms -- The Interval Constrained 3-Coloring Problem -- Counting Hexagonal Patches and Independent Sets in Circle Graphs -- Approximating Maximum Diameter-Bounded Subgraphs -- Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration -- The Complexity of Counting Eulerian Tours in 4-Regular Graphs -- Efficient Edge Domination on Hole-Free Graphs in Polynomial Time -- Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs -- Rank Selection in Multidimensional Data -- Layered Working-Set Trees -- Lightweight Data Indexing and Compression in External Memory.
|
| 650 |
|
0 |
|a Computer Communication Networks
|
| 650 |
|
0 |
|a Computer software
|
| 650 |
|
0 |
|a Computational complexity
|
| 650 |
|
0 |
|a Information systems
|
| 650 |
|
0 |
|a Computer science
|
| 650 |
|
0 |
|a Artificial intelligence
|
| 650 |
|
0 |
|a Computer Science
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer networks .
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Discrete mathematics.
|
| 655 |
|
7 |
|a Konferenzschrift
|y 2010
|z Oaxaca
|0 (DE-588)1071861417
|0 (DE-627)826484824
|0 (DE-576)433375485
|2 gnd-content
|
| 689 |
0 |
0 |
|D s
|0 (DE-588)4196735-5
|0 (DE-627)105201693
|0 (DE-576)210109750
|a Theoretische Informatik
|2 gnd
|
| 689 |
0 |
|
|5 DE-101
|
| 776 |
1 |
|
|z 9783642121999
|
| 776 |
0 |
8 |
|i Buchausg. u.d.T.
|t LATIN 2010: theoretical informatics
|d Berlin : Springer, 2010
|h XV, 712 S.
|w (DE-627)62015599X
|w (DE-576)322012015
|z 3642121993
|z 9783642121999
|
| 830 |
|
0 |
|a Lecture notes in computer science
|v 6034
|9 6034
|w (DE-627)316228877
|w (DE-576)093890923
|w (DE-600)2018930-8
|x 1611-3349
|7 ns
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-12200-2
|m X:SPRINGER
|x Verlag
|z lizenzpflichtig
|3 Volltext
|
| 856 |
4 |
2 |
|u https://zbmath.org/?q=an:1185.68011
|m B:ZBM
|v 2021-04-12
|x Verlag
|y Zentralblatt MATH
|3 Inhaltstext
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|b 2010
|
| 912 |
|
|
|a ZDB-2-SEB
|
| 912 |
|
|
|a ZDB-2-SCS
|b 2010
|
| 912 |
|
|
|a ZDB-2-SXCS
|b 2010
|
| 912 |
|
|
|a ZDB-2-SEB
|b 2010
|
| 936 |
r |
v |
|a SS 4800
|b Lecture notes in computer science
|k Informatik
|k Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen
|k Schriftenreihen (indiv. Sign.)
|k Lecture notes in computer science
|0 (DE-627)1271461242
|0 (DE-625)rvk/143528:
|0 (DE-576)201461242
|
| 936 |
b |
k |
|a 54.10
|j Theoretische Informatik
|q SEPA
|0 (DE-627)106418815
|
| 951 |
|
|
|a BO
|
| 900 |
|
|
|a Ortiz, Alejandro López-
|
| 950 |
|
|
|a Informatik
|
| 950 |
|
|
|a Theorie
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-12200-2
|9 DE-14
|
| 852 |
|
|
|a DE-14
|z 2011-07-20T14:58:54Z
|x epn:3333414902
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-12200-2
|9 DE-15
|
| 852 |
|
|
|a DE-15
|z 2011-05-16T16:36:47Z
|x epn:333341497X
|
| 976 |
|
|
|h Elektronischer Volltext - Campuslizenz
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-12200-2
|z Zum Online-Dokument
|9 DE-Zi4
|
| 852 |
|
|
|a DE-Zi4
|z 2011-01-26T14:35:25Z
|x epn:3333415046
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-12200-2
|9 DE-520
|
| 852 |
|
|
|a DE-520
|z 2010-05-27T13:21:22Z
|x epn:3333415097
|
| 980 |
|
|
|a 1649435339
|b 0
|k 1649435339
|o 323615384
|
SOLR
| _version_ |
1789360298350608384 |
| access_facet |
Electronic Resources |
| author |
López-Ortiz, Alejandro |
| author_facet |
López-Ortiz, Alejandro |
| author_role |
aut |
| author_sort |
López-Ortiz, Alejandro |
| author_variant |
a l o alo |
| callnumber-first |
Q - Science |
| callnumber-label |
QA76 |
| callnumber-raw |
QA76.9.A43 |
| callnumber-search |
QA76.9.A43 |
| callnumber-sort |
QA 276.9 A43 |
| callnumber-subject |
QA - Mathematics |
| collection |
ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS |
| contents |
Continuous and Discrete Methods in Computer Science -- Colorful Strips -- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions -- Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set -- Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines -- Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width -- Average Parameterization and Partial Kernelization for Computing Medians -- Sharp Separation and Applications to Exact and Parameterized Algorithms -- Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight -- The Language Theory of Bounded Context-Switching -- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling -- Packet Routing on the Grid -- Faithful Representations of Graphs by Islands in the Extended Grid -- The I/O Complexity of Sparse Matrix Dense Matrix Multiplication -- Sparse Recovery Using Sparse Random Matrices -- Optimal Succinctness for Range Minimum Queries -- Compact Rich-Functional Binary Relation Representations -- Radix Cross-Sections for Length Morphisms -- Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata -- Quotient Complexity of Ideal Languages -- Complexity of Operations on Cofinite Languages -- Fast Set Intersection and Two-Patterns Matching -- Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields -- A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication -- Modelling the LLL Algorithm by Sandpiles -- Communication-Efficient Construction of the Plane Localized Delaunay Graph -- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization -- Randomised Broadcasting: Memory vs. Randomness -- Limit Theorems for Random MAX-2-XORSAT -- On Quadratic Threshold CSPs -- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming -- Finding the Best CAFE Is NP-Hard -- The Size and Depth of Layered Boolean Circuits -- Lipschitz Unimodal and Isotonic Regression on Paths and Trees -- Ambiguity and Deficiency in Costas Arrays and APN Permutations -- Iterated Shared Memory Models -- Optimal Polygonal Representation of Planar Graphs -- Minimum-Perimeter Intersecting Polygons -- Finding the Smallest Gap between Sums of Square Roots -- Matching Points with Things -- Homotopic Rectilinear Routing with Few Links and Thick Edges -- Tilings Robust to Errors -- Visiting a Sequence of Points with a Bevel-Tip Needle -- Euclidean Prize-Collecting Steiner Forest -- Prize-Collecting Steiner Networks via Iterative Rounding -- Kernelization through Tidying -- Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials -- The Power of Fair Pricing Mechanisms -- Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization -- Some Observations on Holographic Algorithms -- The Interval Constrained 3-Coloring Problem -- Counting Hexagonal Patches and Independent Sets in Circle Graphs -- Approximating Maximum Diameter-Bounded Subgraphs -- Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration -- The Complexity of Counting Eulerian Tours in 4-Regular Graphs -- Efficient Edge Domination on Hole-Free Graphs in Polynomial Time -- Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs -- Rank Selection in Multidimensional Data -- Layered Working-Set Trees -- Lightweight Data Indexing and Compression in External Memory. |
| ctrlnum |
(DE-627)1649435339, (DE-576)323615384, (DE-599)BSZ323615384, (OCoLC)700000366, (OCoLC)845760678, (ZBM)1185.68011, (DE-He213)978-3-642-12200-2, (EBP)040518922 |
| de15_date |
2011-05-16T16:36:47Z |
| doi_str_mv |
10.1007/978-3-642-12200-2 |
| era_facet |
2010 |
| facet_912a |
ZDB-2-SCS, ZDB-2-LNC, ZDB-2-SEB, ZDB-2-SXCS |
| facet_avail |
Online |
| facet_local_del330 |
Theoretische Informatik |
| finc_class_facet |
Informatik, Mathematik |
| finc_id_str |
0000871600 |
| fincclass_txtF_mv |
science-computerscience |
| format |
eBook, ConferenceProceedings |
| format_access_txtF_mv |
Book, E-Book |
| format_de105 |
Ebook |
| format_de14 |
Book, E-Book |
| format_de15 |
Book, E-Book |
| format_del152 |
Buch |
| format_detail_txtF_mv |
text-online-monograph-independent-conference |
| format_dezi4 |
e-Book |
| format_finc |
Book, E-Book |
| format_legacy |
ElectronicBook |
| format_legacy_nrw |
Book, E-Book |
| format_nrw |
Book, E-Book |
| format_strict_txtF_mv |
E-Book |
| genre |
Konferenzschrift 2010 Oaxaca (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content |
| genre_facet |
Konferenzschrift |
| geogr_code |
not assigned |
| geogr_code_person |
not assigned |
| geographic_facet |
Oaxaca |
| hierarchy_parent_id |
0-316228877 |
| hierarchy_parent_title |
Lecture notes in computer science |
| hierarchy_sequence |
6034 |
| hierarchy_top_id |
0-316228877 |
| hierarchy_top_title |
Lecture notes in computer science |
| id |
0-1649435339 |
| illustrated |
Not Illustrated |
| imprint |
Berlin, Heidelberg, Springer Berlin Heidelberg, 2010 |
| imprint_str_mv |
Berlin, Heidelberg: Springer Berlin Heidelberg, 2010 |
| institution |
DE-14, DE-Zi4, DE-520, DE-15 |
| is_hierarchy_id |
0-1649435339 |
| is_hierarchy_title |
LATIN 2010: Theoretical Informatics: 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings |
| isbn |
9783642122002 |
| isbn_isn_mv |
9783642121999, 3642121993 |
| issn_isn_mv |
1611-3349 |
| kxp_id_str |
1649435339 |
| language |
English |
| last_indexed |
2024-01-28T18:35:58.558Z |
| local_heading_facet_dezwi2 |
Computer Communication Networks, Computer software, Computational complexity, Information systems, Computer science, Artificial intelligence, Computer Science, Algorithms., Computer networks ., Computer programming., Discrete mathematics., Theoretische Informatik |
| marc024a_ct_mv |
10.1007/978-3-642-12200-2 |
| match_str |
lopezortiz2010latin2010theoreticalinformatics9thlatinamericansymposiumoaxacamexicoapril19232010proceedings |
| mega_collection |
Verbunddaten SWB |
| multipart_link |
093890923 |
| multipart_part |
(093890923)6034 |
| names_id_str_mv |
(DE-627)125945794X, (DE-576)189457945 |
| oclc_num |
700000366, 845760678 |
| physical |
Online-Ressource (XV, 706p. 143 illus, digital) |
| publishDate |
2010 |
| publishDateSort |
2010 |
| publishPlace |
Berlin, Heidelberg |
| publisher |
Springer Berlin Heidelberg |
| record_format |
marcfinc |
| record_id |
323615384 |
| recordtype |
marcfinc |
| rsn_id_str_mv |
(DE-15)2461756 |
| rvk_facet |
SS 4800 |
| rvk_label |
Informatik, Enzyklopädien und Handbücher. Kongressberichte Schriftenreihe. Tafeln und Formelsammlungen, Schriftenreihen (indiv. Sign.), Lecture notes in computer science |
| rvk_path |
SS, SQ - SU, SS 4000 - SS 5999, SS 4800 |
| rvk_path_str_mv |
SS, SQ - SU, SS 4000 - SS 5999, SS 4800 |
| series |
Lecture notes in computer science, 6034 |
| series2 |
Lecture Notes in Computer Science ; 6034, SpringerLink ; Bücher |
| source_id |
0 |
| spelling |
López-Ortiz, Alejandro (DE-627)125945794X (DE-576)189457945 aut, LATIN 2010: Theoretical Informatics 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings edited by Alejandro López-Ortiz, Berlin, Heidelberg Springer Berlin Heidelberg 2010, Online-Ressource (XV, 706p. 143 illus, digital), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, Lecture Notes in Computer Science 6034, SpringerLink Bücher, Continuous and Discrete Methods in Computer Science -- Colorful Strips -- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions -- Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set -- Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines -- Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width -- Average Parameterization and Partial Kernelization for Computing Medians -- Sharp Separation and Applications to Exact and Parameterized Algorithms -- Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight -- The Language Theory of Bounded Context-Switching -- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling -- Packet Routing on the Grid -- Faithful Representations of Graphs by Islands in the Extended Grid -- The I/O Complexity of Sparse Matrix Dense Matrix Multiplication -- Sparse Recovery Using Sparse Random Matrices -- Optimal Succinctness for Range Minimum Queries -- Compact Rich-Functional Binary Relation Representations -- Radix Cross-Sections for Length Morphisms -- Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata -- Quotient Complexity of Ideal Languages -- Complexity of Operations on Cofinite Languages -- Fast Set Intersection and Two-Patterns Matching -- Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields -- A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication -- Modelling the LLL Algorithm by Sandpiles -- Communication-Efficient Construction of the Plane Localized Delaunay Graph -- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization -- Randomised Broadcasting: Memory vs. Randomness -- Limit Theorems for Random MAX-2-XORSAT -- On Quadratic Threshold CSPs -- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming -- Finding the Best CAFE Is NP-Hard -- The Size and Depth of Layered Boolean Circuits -- Lipschitz Unimodal and Isotonic Regression on Paths and Trees -- Ambiguity and Deficiency in Costas Arrays and APN Permutations -- Iterated Shared Memory Models -- Optimal Polygonal Representation of Planar Graphs -- Minimum-Perimeter Intersecting Polygons -- Finding the Smallest Gap between Sums of Square Roots -- Matching Points with Things -- Homotopic Rectilinear Routing with Few Links and Thick Edges -- Tilings Robust to Errors -- Visiting a Sequence of Points with a Bevel-Tip Needle -- Euclidean Prize-Collecting Steiner Forest -- Prize-Collecting Steiner Networks via Iterative Rounding -- Kernelization through Tidying -- Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials -- The Power of Fair Pricing Mechanisms -- Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization -- Some Observations on Holographic Algorithms -- The Interval Constrained 3-Coloring Problem -- Counting Hexagonal Patches and Independent Sets in Circle Graphs -- Approximating Maximum Diameter-Bounded Subgraphs -- Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration -- The Complexity of Counting Eulerian Tours in 4-Regular Graphs -- Efficient Edge Domination on Hole-Free Graphs in Polynomial Time -- Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs -- Rank Selection in Multidimensional Data -- Layered Working-Set Trees -- Lightweight Data Indexing and Compression in External Memory., Computer Communication Networks, Computer software, Computational complexity, Information systems, Computer science, Artificial intelligence, Computer Science, Algorithms., Computer networks ., Computer programming., Discrete mathematics., Konferenzschrift 2010 Oaxaca (DE-588)1071861417 (DE-627)826484824 (DE-576)433375485 gnd-content, s (DE-588)4196735-5 (DE-627)105201693 (DE-576)210109750 Theoretische Informatik gnd, DE-101, 9783642121999, Buchausg. u.d.T. LATIN 2010: theoretical informatics Berlin : Springer, 2010 XV, 712 S. (DE-627)62015599X (DE-576)322012015 3642121993 9783642121999, Lecture notes in computer science 6034 6034 (DE-627)316228877 (DE-576)093890923 (DE-600)2018930-8 1611-3349 ns, https://doi.org/10.1007/978-3-642-12200-2 X:SPRINGER Verlag lizenzpflichtig Volltext, https://zbmath.org/?q=an:1185.68011 B:ZBM 2021-04-12 Verlag Zentralblatt MATH Inhaltstext, http://dx.doi.org/10.1007/978-3-642-12200-2 DE-14, DE-14 2011-07-20T14:58:54Z epn:3333414902, http://dx.doi.org/10.1007/978-3-642-12200-2 DE-15, DE-15 2011-05-16T16:36:47Z epn:333341497X, http://dx.doi.org/10.1007/978-3-642-12200-2 Zum Online-Dokument DE-Zi4, DE-Zi4 2011-01-26T14:35:25Z epn:3333415046, http://dx.doi.org/10.1007/978-3-642-12200-2 DE-520, DE-520 2010-05-27T13:21:22Z epn:3333415097 |
| spellingShingle |
López-Ortiz, Alejandro, LATIN 2010: Theoretical Informatics: 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, Lecture notes in computer science, 6034, Continuous and Discrete Methods in Computer Science -- Colorful Strips -- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions -- Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set -- Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines -- Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width -- Average Parameterization and Partial Kernelization for Computing Medians -- Sharp Separation and Applications to Exact and Parameterized Algorithms -- Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight -- The Language Theory of Bounded Context-Switching -- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling -- Packet Routing on the Grid -- Faithful Representations of Graphs by Islands in the Extended Grid -- The I/O Complexity of Sparse Matrix Dense Matrix Multiplication -- Sparse Recovery Using Sparse Random Matrices -- Optimal Succinctness for Range Minimum Queries -- Compact Rich-Functional Binary Relation Representations -- Radix Cross-Sections for Length Morphisms -- Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata -- Quotient Complexity of Ideal Languages -- Complexity of Operations on Cofinite Languages -- Fast Set Intersection and Two-Patterns Matching -- Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields -- A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication -- Modelling the LLL Algorithm by Sandpiles -- Communication-Efficient Construction of the Plane Localized Delaunay Graph -- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization -- Randomised Broadcasting: Memory vs. Randomness -- Limit Theorems for Random MAX-2-XORSAT -- On Quadratic Threshold CSPs -- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming -- Finding the Best CAFE Is NP-Hard -- The Size and Depth of Layered Boolean Circuits -- Lipschitz Unimodal and Isotonic Regression on Paths and Trees -- Ambiguity and Deficiency in Costas Arrays and APN Permutations -- Iterated Shared Memory Models -- Optimal Polygonal Representation of Planar Graphs -- Minimum-Perimeter Intersecting Polygons -- Finding the Smallest Gap between Sums of Square Roots -- Matching Points with Things -- Homotopic Rectilinear Routing with Few Links and Thick Edges -- Tilings Robust to Errors -- Visiting a Sequence of Points with a Bevel-Tip Needle -- Euclidean Prize-Collecting Steiner Forest -- Prize-Collecting Steiner Networks via Iterative Rounding -- Kernelization through Tidying -- Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials -- The Power of Fair Pricing Mechanisms -- Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization -- Some Observations on Holographic Algorithms -- The Interval Constrained 3-Coloring Problem -- Counting Hexagonal Patches and Independent Sets in Circle Graphs -- Approximating Maximum Diameter-Bounded Subgraphs -- Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration -- The Complexity of Counting Eulerian Tours in 4-Regular Graphs -- Efficient Edge Domination on Hole-Free Graphs in Polynomial Time -- Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs -- Rank Selection in Multidimensional Data -- Layered Working-Set Trees -- Lightweight Data Indexing and Compression in External Memory., Computer Communication Networks, Computer software, Computational complexity, Information systems, Computer science, Artificial intelligence, Computer Science, Algorithms., Computer networks ., Computer programming., Discrete mathematics., Konferenzschrift 2010 Oaxaca, Theoretische Informatik |
| swb_id_str |
323615384 |
| title |
LATIN 2010: Theoretical Informatics: 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings |
| title_auth |
LATIN 2010: Theoretical Informatics 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings |
| title_full |
LATIN 2010: Theoretical Informatics 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings edited by Alejandro López-Ortiz |
| title_fullStr |
LATIN 2010: Theoretical Informatics 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings edited by Alejandro López-Ortiz |
| title_full_unstemmed |
LATIN 2010: Theoretical Informatics 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings edited by Alejandro López-Ortiz |
| title_in_hierarchy |
6034. LATIN 2010: Theoretical Informatics: 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings (2010) |
| title_short |
LATIN 2010: Theoretical Informatics |
| title_sort |
latin 2010 theoretical informatics 9th latin american symposium oaxaca mexico april 19 23 2010 proceedings |
| title_sub |
9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings |
| title_unstemmed |
LATIN 2010: Theoretical Informatics: 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings |
| topic |
Computer Communication Networks, Computer software, Computational complexity, Information systems, Computer science, Artificial intelligence, Computer Science, Algorithms., Computer networks ., Computer programming., Discrete mathematics., Konferenzschrift 2010 Oaxaca, Theoretische Informatik |
| topic_facet |
Computer Communication Networks, Computer software, Computational complexity, Information systems, Computer science, Artificial intelligence, Computer Science, Algorithms., Computer networks ., Computer programming., Discrete mathematics., Konferenzschrift, Theoretische Informatik |
| url |
https://doi.org/10.1007/978-3-642-12200-2, https://zbmath.org/?q=an:1185.68011, http://dx.doi.org/10.1007/978-3-642-12200-2 |
