X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    LATIN 2010: Theoretical Informatics : 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings (2010)
    Berlin, Heidelberg :Springer Berlin Heidelberg,
    Details
    UID:
    almahu_9947364141602882
    Format: XV, 706 p. 143 illus. , online resource.
    ISBN: 9783642122002
    Series Statement: Lecture Notes in Computer Science, 6034
    Note: 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.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783642121999
    Language: English
    DOI: 10.1007/978-3-642-12200-2
    URL: http://dx.doi.org/10.1007/978-3-642-12200-2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Open Access Request
    HU Berlin
  • 2
    Online Resource
    Online Resource
    LATIN 2010: Theoretical Informatics : 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010 ; proceedings (2010)
    Berlin [u.a.] : Springer
    Details
    UID:
    b3kat_BV036499218
    Format: 1 Online-Ressource (XV, 712 S.) , graph. Darst.
    ISBN: 9783642122002
    Series Statement: Lecture Notes in Computer Science 6034
    Additional Edition: Erscheint auch als Druck-Ausgabe, Paperback ISBN 978-3-642-12199-9
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Theoretische Informatik ; Konferenzschrift
    DOI: 10.1007/978-3-642-12200-2
    URL: Volltext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    BTU Cottbus
  • 3
    Online Resource
    Online Resource
    LATIN 2010: theoretical informatics : 9th Latin American symposium, Oaxaca, Mexico, April 19 - 23, 2010 ; proceedings (2010)
    Berlin [u.a.] : Springer
    Show associated volumes
    Details
    UID:
    gbv_62692054X
    Format: Online-Ressource (XV, 712 S.)
    Edition: Online-Ausg. 2010 Springer eBook collection. Computer science Electronic reproduction; Available via World Wide Web
    ISBN: 9783642122002
    Series Statement: Lecture notes in computer science 6034
    Note: Literaturangaben , Electronic reproduction; Available via World Wide Web
    Additional Edition: ISBN 3642121993
    Additional Edition: ISBN 9783642121999
    Additional Edition: Erscheint auch als Druck-Ausgabe LATIN 2010: theoretical informatics Berlin : Springer, 2010 ISBN 3642121993
    Additional Edition: ISBN 9783642121999
    Language: English
    Subjects: Computer Science
    RVK:
    SS 4800
    Keywords: Theoretische Informatik ; Konferenzschrift
    DOI: 10.1007/978-3-642-12200-2
    URL: Volltext
    URL: Volltext  (lizenzpflichtig)
    URL: Inhaltsverzeichnis
    URL: Inhaltstext
    URL: Inhaltstext
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
    UB Potsdam
  • 4
    Online Resource
    Online Resource
    Efficient edge domination on hole-free graphs in polynomial time (2010)
    Show associated volumes
    Details
    UID:
    gbv_630631735
    Format: graph. Darst.
    ISBN: 9783642122002
    In: LATIN 2010: theoretical informatics, Berlin [u.a.] : Springer, 2010, (2010), Seite 650-661, 9783642122002
    In: year:2010
    In: pages:650-661
    Language: English
    DOI: 10.1007/978-3-642-12200-2_56
    URL: Volltext
    URL: Volltext
    Author information: Brandstädt, Andreas 1949-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Online Resource
    Online Access
    Open Access Request
Nothing or not found what you are looking for? Please check your search query or use the Interlibrary Loan Search.
Did you mean 9783641220402?
Did you mean 9783642106002?
Did you mean 9783641222062?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages