Lars Arge


Ontology type: schema:Person     


Person Info

NAME

Lars

SURNAME

Arge

Publications in SciGraph latest 50 shown

  • 2016-12 Guest Editors’ Foreword in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2016 Computing River Floods Using Massive Terrain Data in GEOGRAPHIC INFORMATION SCIENCE
  • 2015-12 RAM-Efficient External Memory Sorting in ALGORITHMICA
  • 2013-09 Topographically controlled soil moisture drives plant diversity patterns within grasslands in BIODIVERSITY AND CONSERVATION
  • 2013-04 (Approximate) Uncertain Skylines in THEORY OF COMPUTING SYSTEMS
  • 2013 RAM-Efficient External Memory Sorting in ALGORITHMS AND COMPUTATION
  • 2013 On (Dynamic) Range Minimum Queries in External Memory in ALGORITHMS AND DATA STRUCTURES
  • 2013 An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters in ALGORITHMS – ESA 2013
  • 2012-06 External Memory Planar Point Location with Logarithmic Updates in ALGORITHMICA
  • 2012 Simplifying Massive Contour Maps in ALGORITHMS – ESA 2012
  • 2011-06 Geographically Comprehensive Assessment of Salt-Meadow Vegetation-Elevation Relations Using LiDAR in WETLANDS
  • 2009-10 Foreword in ALGORITHMICA
  • 2009-07 Optimal External Memory Planar Point Enclosure in ALGORITHMICA
  • 2009 Recent Advances in Worst-Case Efficient Range Search Indexing in ADVANCES IN SPATIAL AND TEMPORAL DATABASES
  • 2009 I/O-Efficient Contour Tree Simplification in ALGORITHMS AND COMPUTATION
  • 2009-01 Cache-Oblivious R-Trees in ALGORITHMICA
  • 2008 Cache-Oblivious Red-Blue Line Segment Intersection in ALGORITHMS - ESA 2008
  • 2007-01 External-Memory Algorithms for Processing Line Segments in Geographic Information Systems in ALGORITHMICA
  • 2007 The ComBack Method – Extending Hash Compaction with Backtracking in PETRI NETS AND OTHER MODELS OF CONCURRENCY – ICATPN 2007
  • 2006 From Point Cloud to Grid DEM: A Scalable Approach in PROGRESS IN SPATIAL DATA HANDLING
  • 2006 I/O-Efficient Hierarchical Watershed Decomposition of Grid Terrain Models in PROGRESS IN SPATIAL DATA HANDLING
  • 2005 External Data Structures for Shortest Path Queries on Planar Digraphs in ALGORITHMS AND COMPUTATION
  • 2005 I/O-Efficient Construction of Constrained Delaunay Triangulations in ALGORITHMS – ESA 2005
  • 2004 Simplified External Memory Algorithms for Planar DAGs in ALGORITHM THEORY - SWAT 2004
  • 2004 Optimal External Memory Planar Point Enclosure in ALGORITHMS – ESA 2004
  • 2004 External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2004 Efficient Tradeoff Schemes in Data Structures for Querying Moving Objects in ALGORITHMS – ESA 2004
  • 2004 External Geometric Data Structures in COMPUTING AND COMBINATORICS
  • 2003-12 Efficient Flow Computation on Massive Grid Terrain Datasets in GEOINFORMATICA
  • 2003-09 The Buffer Tree: A Technique for Designing Batched External Data Structures in ALGORITHMICA
  • 2003 I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries in ALGORITHMS - ESA 2003
  • 2003 Bkd-Tree: A Dynamic Scalable kd-Tree in ADVANCES IN SPATIAL AND TEMPORAL DATABASES
  • 2003 Efficient Object-Relational Interval Management and Beyond in ADVANCES IN SPATIAL AND TEMPORAL DATABASES
  • 2002-12-16 CRB-Tree: An Efficient Indexing Scheme for Range-Aggregate Queries in DATABASE THEORY — ICDT 2003
  • 2002-05 Efficient Bulk Operations on Dynamic R-Trees in ALGORITHMICA
  • 2002-04-19 Efficient Bulk Operations on Dynamic R-trees in ALGORITHM ENGINEERING AND EXPERIMENTATION
  • 2002-03-15 I/O-Space Trade-Offs in ALGORITHM THEORY - SWAT 2000
  • 2002-03-15 On External-Memory MST, SSSP, and Multi-way Planar Graph Separation in ALGORITHM THEORY - SWAT 2000
  • 2002 Implementing I/O-efficient Data Structures Using TPIE in ALGORITHMS — ESA 2002
  • 2002 External Memory Data Structures in HANDBOOK OF MASSIVE DATA SETS
  • 2001-08-02 On External-Memory Planar Depth First Search in ALGORITHMS AND DATA STRUCTURES
  • 2001-08-02 Time Responsive External Data Structures for Moving Points in ALGORITHMS AND DATA STRUCTURES
  • 2001 A Framework for Index Bulk Loading and Dynamization in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2001 Efficient Sorting Using Registers and Caches in ALGORITHM ENGINEERING
  • 2001 External Memory Data Structures in ALGORITHMS — ESA 2001
  • 2000 A Unified Approach for Indexed and Non-indexed Spatial Joins in ADVANCES IN DATABASE TECHNOLOGY — EDBT 2000
  • 1997 External-memory algorithms with applications in GIS in ALGORITHMIC FOUNDATIONS OF GEOGRAPHIC INFORMATION SYSTEMS
  • 1995 External-memory algorithms for processing line segments in geographic information systems in ALGORITHMS — ESA '95
  • 1995 The buffer tree: A new technique for optimal I/O-algorithms in ALGORITHMS AND DATA STRUCTURES
  • 1995 The I/O-complexity of Ordered Binary-Decision Diagram manipulation in ALGORITHMS AND COMPUTATIONS
  • Affiliations

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.7048.b", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.26009.3d", 
            "type": "Organization"
          }
        ], 
        "familyName": "Arge", 
        "givenName": "Lars", 
        "id": "sg:person.010251111315.42", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010251111315.42"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:50", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1605.json", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.010251111315.42'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.010251111315.42'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.010251111315.42'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.010251111315.42'


     




    Preview window. Press ESC to close (or click here)


    ...