Colección SciELO Chile

Departamento Gestión de Conocimiento, Monitoreo y Prospección
Consultas o comentarios: productividad@anid.cl
Búsqueda Publicación
Búsqueda por Tema Título, Abstract y Keywords



LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS
ISSN 1868-8969
E-ISSN S/I
País S/I
Indexación WoS Scopus

Publicaciones Chile en el período 2008-2021

Autores Chile en el período 2008-2021


Scopus SNIP - SJR



Año SNIP SJR
2018 0.839 0.512

Muestra los valores de SNIP y SJR de la revista seleccionada en el tiempo.

SNIP y SJR se definen como:

  • SNIP: Mide el impacto de la cita contextual ponderando las citas en función del número total de citas en un campo. El impacto de una única citación se le da mayor valor en áreas donde es menos probable que se cite, y viceversa. SNIP se define como la relación de impacto en bruto de una revista por publicación y el potencial de citas en su campo. Esto permite la evaluación de una revista en comparación con su competencia y proporciona más información contextual, dando una mejor imagen del impacto en función del comportamiento de la citación en el campo.

  • SJR: Es una métrica de prestigio basada en la idea de que no todas las citas son los mismo. Con SJR, el campo del asunto, la calidad y la reputación de la revista tienen un efecto directo sobre el valor de una citación y el impacto de la revista. Además el prestigio de una citación se pondera sobre todas las citas entregados a la revista. SJR es un indicador de tamaño-independiencia y posiciona revistas por su "prestigio promedio por artículo" y se puede utilizar para las comparaciones de revistas en los procesos de evaluación científicos.

Disciplinas y Ranking




Año Ranking Cuartil

Muestra la distribución de disciplinas para la revista.

Cuartiles desplegados de acuerdo a WoS, consultando el Journal Citation Report. Estos cuartiles pueden variar dependiendo de la disciplina consultada.

Publicaciones WoS (Ediciones: ISSHP, ISTP, AHCI, SSCI, SCI), Scopus, SciELO Chile.

Origen de las citas recibidas por la revista



Nombre Revista ISSN/ISBN Indexacion Citas
INFORMATION PROCESSING LETTERS 0020-0190 Externa 1
JOURNAL OF STATISTICAL PHYSICS 0022-4715 Externa 1
ERGODIC THEORY AND DYNAMICAL SYSTEMS 0143-3857 Externa 1
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS 0308-1079 Externa 2
JOURNAL OF CELLULAR AUTOMATA 1557-5969 Externa 1

Listado ordenado (según número de citas) de Revistas que citan a la revista consultada en este perfil.

: Las citas a esta revista provienen de documentos no incluidos en la base de datos de DATACIENCIA

Publicaciones



Título Año Citas
Parameterized Regular Expressions And Their Languages 2011 0
Revisiting The Rice Theorem Of Cellular Automata 2010 6
Ultimate Traces Of Cellular Automata 2010 2
Cryptocurrency Mining Games With Economic Discount And Decreasing Rewards 2020 2
Better Approximations For General Caching And Ufp Cover Under Resource Augmentation 2020 0
Fixed Parameter Algorithms For Unsplittable Flow Cover 2020 0
Pumping Lemmas For Weighted Automata 2018 8
On The Complexity Of Anchored Rectangle Packing 2019 0
Parameterized Approximation Schemes For Independent Set Of Rectangles And Geometric Knapsack 2019 3
Packing Cars Into Narrow Roads: Pta Ss For Limited Supply Highway 2019 0
Maintaining Perfect Matchings At Low Cost 2019 0
Monadic Decomposability Of Regular Relations 2019 0
The Minimum Cost Query Problem On Matroids With Uncertainty Areas 2019 0
Boundedness Of Conjunctive Regular Path Queries 2019 0
Simulating The Dna Overlap Graph In Succinct Space 2019 0
Tree Path Majority Data Structures 2018 0
Symmetry Exploitation For Online Machine Covering With Bounded Migration 2018 0
Quasi Polynomial Time Approximation Schemes For Packing And Covering Problems In Planar Graphs 2018 0
Fixed Parameter Approximation Schemes For Weighted Flowtime 2018 0
Prefix Free Parsing For Building Big Bw Ts 2018 0
Term Graph Anti Unification 2018 0
Superset: A (Super) Natural Variant Of The Card Game Set 2018 0
Online Lz77 Parsing And Matching Statistics With Rlbw Ts 2018 0
Finding Connected Secluded Subgraphs 2018 0
A More General Theory Of Static Approximations For Conjunctive Queries 2018 0
A Local Search Algorithm For Steiner Forest 2018 0
Fast Compressed Self Indexes With Deterministic Linear Time Construction 2017 0
Approximation And Parameterized Algorithms For Geometric Independent Set With Shrinking 2017 0
Type Abstraction For Relaxed Noninterference 2017 0
Parallelizing Julia With A Non Invasive Dsl 2017 0
Three Notes On Distributed Property Testing 2017 0
How Large Is Your Graph? 2017 0
Probabilistic Automata Of Bounded Ambiguity 2017 0
On Minimizing The Makespan When Some Jobs Cannot Be Assigned On The Same Machine 2017 0
An Encoding For Order Preserving Matching 2017 0
Synergistic Solutions On Multisets 2017 0
A (1 + ϵ) Approximation For Unsplittable Flow On A Path In Fixed Parameter Running Time 2017 0
A Qptas For The General Scheduling Problem With Identical Release Dates 2017 0
Path Queries On Functions 2017 0
Document Listing On Repetitive Collections With Guaranteed Performance 2017 0
Fast And Simple Jumbled Indexing For Binary Run Length Encoded Strings 2017 0
The Complexity Of Reverse Engineering Problems For Conjunctive Queries 2017 0
Min Sum Scheduling Under Precedence Constraints 2016 0
Closing The Gap For Makespan Scheduling Via Sparsification Techniques 2016 0
Algorithmic Complexity For The Realization Of An Effective Subshift By A Sofic 2016 0
Optimal Prefix Free Codes With Partial Sorting 2016 0
Estimating Parameters Associated With Monotone Properties 2016 0
Selenite Towers Move Faster Than Hanoï Towers, But Still Require Exponential Time 2016 0
Dynamic Graph Queries 2016 0
Copyless Cost Register Automata: Structure, Expressiveness, And Closure Properties 2016 2
Maximal Partition Logic: Towards A Logical Characterization Of Copyless Cost Register Automata 2015 0
On Guillotine Cutting Sequences 2015 0
Regular Queries On Graph Databases 2015 0
Construct Queries In Sparql 2015 0
On The Data Complexity Of Consistent Query Answering Over Graph Databases 2015 0
On The Information Carried By Programs About The Objects They Compute 2015 2
Asymptotically Optimal Encodings For Range Selection 2014 0
Compressed Representations Of Permutations, And Applications 2009 0
Breaking The Barrier Of 2 For The Storage Allocation Problem 2020 0
A Water Filling Primal Dual Algorithm For Approximating Non Linear Covering Problems 2020 0
On The Two Dimensional Knapsack Problem For Convex Polygons 2020 0
Text Indexing And Searching In Sublinear Time 2020 0
Dynamic Approximate Maximum Independent Set Of Intervals, Hypercubes And Hyperrectangles 2020 0
A Formal Framework For Complex Event Processing 2019 0
The Shapley Value Of Tuples In Query Answering 2020 0
A Family Of Centrality Measures For Graph Data Based On Subgraphs 2020 0
On The Expressiveness Of Languages For Complex Event Recognition 2020 0
Towards Streaming Evaluation Of Queries With Correlation In Complex Event Processing 2020 0
On The Expressiveness Of Lara: A Unified Language For Linear And Relational Algebra 2020 0
Optimal Joins Using Compact Data Structures 2020 0
The Computational Complexity Of Evil Hangman 2020 0
On Guillotine Separable Packings For The Two Dimensional Geometric Knapsack Problem 2021 0
Improved Approximation Algorithms For 2 Dimensional Knapsack: Packing Into Multiple L Shapes, Spirals, And More 2021 0
A Job Dispatcher For Large And Heterogeneous Hpc Systems Running Modern Applications 2021 0
Data Driven Vrp: A Neural Network Model To Learn Hidden Preferences For Vrp 2021 0
Machine Covering In The Random Order Model 2021 0
Fully Dynamic Algorithms For Knapsack Problems With Polylogarithmic Update Time 2021 0
Dynamic Data Structures For Timed Automata Acceptance 2021 0
Additive Approximation Schemes For Load Balancing Problems 2021 0
A Fast And Small Subsampled R Index 2021 0
Gradual Program Analysis For Null Pointers 2021 0
Fpt And Fpt Approximation Algorithms For Unsplittable Flow On Trees 2021 0
Faster (1 + ϵ) Approximation For Unsplittable Flow On A Path Via Resource Augmentation And Back 2021 0
Shared Vs Private Randomness In Distributed Interactive Proofs 2020 0
Multiple Random Walks On Graphs: Mixing Few To Cover Many 2021 0
Streaming Enumeration On Nested Documents 2022 0
Efficient Construction Of The Bwt For Repetitive Text Using String Compression 2022 0
Bi Directional R Indexes 2022 0
Cover And Hitting Times Of Hyperbolic Random Graphs 2022 0
Techniques For Generalized Colorful K Center Problems 2022 0
Finding And Counting Patterns In Sparse Graphs 2023 0
Computing Power Of Hybrid Models In Synchronous Networks 2023 0
Constant Depth Sorting Networks 2023 0
Size Bounds And Algorithms For Conjunctive Regular Path Queries 2023 0
Constant Delay Enumeration For Slp Compressed Documents 2023 0
Compact Data Structures Meet Databases 2023 0
Absolute Expressiveness Of Subgraph Based Centrality Measures 2023 0
A Researcher's Digest Of Gql 2023 0
How Do Centrality Measures Choose The Root Of Trees? 2023 0
Construction Of Mu Limit Sets Of Two Dimensional Cellular Automata 2015 0
Brief Announcement: Computing Power Of Hybrid Models In Synchronous Networks 2022 0
Ranked Enumeration Of Mso Logic On Words 2021 0
Sorting Finite Automata Via Partition Refinement 2023 0
Development And Operationalisation Of Local Sustainability Indicators A Global South Perspective On Data Challenges And Opportunities For Gi Science 2023 0
Separating Automatic Relations 2023 0
On The Impact Of Morphisms On Bwt Runs 2023 0
L Systems For Measuring Repetitiveness 2023 0
Faster Prefix Sorting Algorithms For Deterministic Finite Automata 2023 0
Trie Compressed Adaptive Set Intersection 2023 0
Computing Me Ms On Repetitive Text Collections 2023 0
Distributed Certification For Classes Of Dense Graphs 2023 0
Energy Games Over Totally Ordered Groups 2024 0
Rumors With Changing Credibility 2024 0
Enumeration And Updates For Conjunctive Linear Algebra Queries Through Expressibility 2024 0
Communication Cost Of Joins Over Federated Data 2024 0

Listado de publicaciones y sus citas para la revista seleccionada.


Descargar Descarga los datos de esta página (formato JSON).
Descargar Descarga los datos de esta página como un archivo Excel.