yusuke1997/dblp-id-title huggingface dataset:
Median calculation for heterogeneous complex of abstract cubes
Towards a Font Classification Model for Romanian Cyrillic Documents
Designing and Building Modern Information Systems; A Series of Decisions to Be Made
A new type of digital signature algorithms with a hidden group
Arithmetically Controlled H Systems
Communicative automata based programming. Society Framework
Nash equilibria set computing in finite extended games
Complex Time for Chaoplex Systems: From Newton to Wiener
Integrity and correctness checking of a lexical database
On groupoids with Bol-Moufang type identities
Evaluating the impact of software metrics on defects prediction. Part 2
The general prioritization framework
Remarks on Some Newton and Chebyshev-type Methods for Approximation Eigenvalues and Eigenvectors of Matrices
Post-graduate Studies in Mathematics and Computer Science Proposed by the Institute of Mathematics and Computer Science of the Academy of Sciences of the Republic of Moldova
Optic Disc Identification Methods for Retinal Images
Hospital-Scale Chest X-Ray Database Visualization Using RAWGraph Technique
An Automatic Proof of Euler's Formula
An algorithm for solving a class of knapsack problems and its generalization
Stream Deniable-Encryption Algorithms
A Pseudo-Statistic Edge Detector using Fuzzy Computation
Basics of Intensionalized Data: Presets, Sets, and Nominats
Integer programming models for colorings of mixed hypergraphs
Developing a derivatives generator
A quantitative analysis of the performance of functional distributed architectures
Secret Sharing Limitations Over Boolean Circuits
Abstracts of Ph.D. theses defended by the collaborators and post graduates of the Laboratory of Artificial Intelligence Systems of the Institute of Mathematics ASM
Loser-out multi metaheuristic framework for multi-objective optimization
Concurrency specification using Event-based Specification Chart
Finite automata over magmas: models and some applications in Cryptography
Finding Translation Examples for Under-Resourced Language Pairs or for Narrow Domains; the Case for Machine Translation
Approaches to automated construction of graphical shells for computer algebra systems
Ekaterina Logvinovna Yushchenko (a tribute in her memory)
Perfect Octagon Quadrangle Systems with an upper C 4 -system and a large spectrum
Traveling Salesman Problem with Transportation
On P Systems with Membrane Creation
Confluent-Functional solving systems
A Stochastic Map Model of Phase Transition in Internet Traffic
Developments in Networks of Evolutionary Processors
Outer independent total double Italian domination number
Vertex weighted Laplacian Energy of union of graphs
About Shannon's problem for turing machines
Chromatic Polynomials Of Some (m, l)-Hyperwheels
Medical Image Registration by means of a Bio-Inspired Optimization Strategy
Generating Report in Ultrasonographic Diagnostics System SonaRes
Electronic Services in Public Administration (e-government); Privacy and Freedom of Information. (review of study made for situation in Moldova)
List of the selected papers in the field of computer science, published by the collaborators of the IM ASM
The concept of training device and task description language for teaching programming
On the upper chromatic index of a multigraph
Solving transportation problems with concave cost functions using genetic algorithms
Determination of the Image Complexity Feature in Pattern Recognitions
Visualizing Type-Checking Proofs: An Educational Web-Based System for an Extended Simply Typed Lambda Calculus
Deep learning-based software for detecting population density of Antarctic birds
Closeness centrality in some splitting networks
Wiener Index of Some Brooms
The response time analysis of queuing model in cloud computing environment
From Word Alignment to Word Senses, via Multilingual Wordnets
On strong quasistability of a vector problem on substitutions
Class Cohesion Metrics for Software Engineering: A Critical Review
Bandwidth Allocation Algorithm for Makespan Optimization in a Fog-Cloud Environment: Monitoring Application
Computing Comprehensive Gröbner Systems: A Comparison of Two Methods
On the Family of Conditional Embedded Implicational Dependencies
Chromatic Spectrum of K s -WORM Colorings of K n *
About some classes of periodic orbits in a problem of two fixed centres
Search tree-based approach for the p-median problem using the ant colony optimization algorithm
Deep Learning Method for Multi-Attribute Analysis of Fingerprint Images
Computing one of Victor Moll's irresistible integrals with computer algebra
Robust Geometric Programming Approach to Profit Maximization with Interval Uncertainty
Small Universal Circular Post Machines
Diversification in an image retrieval system based on text and image processing
We are proud to be side by side
Efficient GPU Power Management through Advanced Framework Utilizing Optimization Algorithms
Parsing the Dictionary of Modern Literary Russian Language with the Method of SCD Configurations. The Lexicographic Modeling
The representation method of a complex software system dynamic project
The Physical-mathematical Theory of Hyper-random Phenomena
Executable choreographies applied in OPERANDO
Ordering of jobs with three different processing times in the Mxn Bellman-Johnson problem
The ascertainment of the inflexion models for Romanian
A New Attempt On The F5 Criterion
Integrating Recurrent Neural Networks and Loss Function Optimization for Efficient Indoor Camera Positioning
Stability of generally efficient situation in finite cooperative games with parametric optimality principle ("from Pareto to Nash")
On computational properties of gene assembly in ciliates
A Deterministic and Polynomial Modified Perceptron Algorithm
On quasistability radius of a vector trajectorial problem with a principle of optimality generalizing Pareto and lexicographic principles
On Nontrivial Covers and Partitions of Graphs by Convex Sets
An algorithm of graph planarity testing and cross minimization
The splitting method and Poincare's theorem: (II) - matrix, polynomial and language
Qualitative Aggregation of Information in Fuzzy Attribute Model
Performance evaluation of clustering techniques for image segmentation
A Secret Image Sharing Based on Logistic-Chebyshev Chaotic Map and Chinese Remainder Theorem
About CMC14
Object class hierarchy for an incremental hypertext editor
Nominative data with ordered set of names
Matrix balancing and robust Monte Carlo algorithm for evaluating dominant eigenpair
Researches in Artificial Intelligence in Republic of Moldova
Models Nonlinear by Parameters
Some Aspects of Mathematical and Physical Approaches for Topological Quantum Computation
The graphic representations for the one-dimensional solutions of problem from elastic mechanic deformations of two-component mixture
On quasi-stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero
Decision support systems in ultrasound diagnostics
Fuzzy logic foundations of optimal inference
A New Full-Newton Step O(n) Infeasible Interior-Point Algorithm for P * (κ)-horizontal Linear Complementarity Problems
About Workshop in the framework of NIMSPPS project
A generalization of the optimality for multicriterion problems
The last achievements in Steiner tree approximations
Apportionment "Population paradox" and the Paradox of population influence
The approximate solution of singular integro- differential equations on smooth contours in the spaces L p
HTTP Security Headers Analysis of Several Macedonian Website Categories
A new multi-offspring crossover operator for genetic algorithm to facilitate the traveling salesman problem
Numerical solutions of Kendall and Pollaczek-Khintchin equations for exhaustive polling systems with semi-Markov delays
Quantitative Expressiveness of Instruction Sequence Classes for Computation on Single Bit Registers
Yurii Nikolaevich Pechersky (a tribute in his memory)
Intelligent Robust Robotic Controllers: SW & HW Toolkit of Applied Quantum Soft Computing
Graphs with Large Hop Roman Domination Number
Simulator of P-Systems with String Replication Developed in Framework of P-Lingua 2.1
Identity, Ontology, and Frege's Problem
A remark on the weak Turán's Theorem
Non-commutative finite associative algebras of 2-dimension vectors
Applying Evolution Strategies for Chest Radiographs Segmentation
Design and code coupling assessment based on defects prediction. Part 1
Analysis and Modeling of Vapor Recompressive Distillation Using ASPEN-HYSYS
Taxonomy of Strategic Games with Information Leaks and Corruption of Simultaneity
Generalized ABC Energy of Weighted Graphs
The digital technologies as the chance for sustainable development of Moldova
Mixed Algorithm for Combinations Generation
Working Out R&D Programs via Multicriteria Analysis
Using of P2P Networks for Acceleration of RTE Tasks Solving
On Soundness for Time Workflow Nets
An Overview of a PC Based Data Acquisition System
Contrastive Meanings of the Terms "Predicative" and "Predicational" in Various Linguistic Theories (I.)
Quasigroups in cryptology
An Approach to Recognizing and Digitizing Old Handwritten Documents with Mathematical Heterogeneous Content in Cyrillic script
Two railway circuits: a universal circuit and an NP-difficult one
Fast DDP-Based Ciphers: Design and Differential Analysis of Cobra-H64
Mental Disorder Diagnostic System Based on Logical-Combinatorial Methods of Pattern Recognition
Some applications of quasigroups in cryptology
On stability in game problems of finding Nash set
Fuzzy Rule-based System for Pattern Recognition and Automated Classification
Parallel algorithm to find Bayes-Nash solution to the bimatrix informational extended game
Recognition and Prediction for Implicit Contrastive Focus in Romanian
Total Italian domatic number of graphs
Text Classification Using Word-Based PPM Models
Abstracts of Dr. Thesis
Some small self-describing Turing machines
Experimental results on quadratic assignment problem
On a k-clique-join of a class of partitionable graphs
Syntesis of group project decisions in distributed computer decision support systems
Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games
Complex Membership Grades with an Application to the Design of Adaptive Filters
Hybrid technology for collective expertise
The XIV Conference on Applied and Industrial Mathematics dedicated to the 60th anniversary of the foundation of the Department of Mathematics and Computer Science of Moldova State University
Linked Data Lineage as a foundation of continuous data integration and modern data governance
The comparative analysis of implementation practices of e-government services
Succinct Representation of Balanced Parentheses and Static Trees
Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems
Full Constraint Satisfaction Problems
Special Section on the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC 2012)
A Direct Product Theorem for Quantum Communication Complexity with Applications to Device-Independent Cryptography
Linear Time Algorithms for Two- and Three-Variable Linear Programs
Maximizing Non-monotone Submodular Functions
Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs
Probabilistic Bounds on the Performance of List Scheduling
On the Communication Complexity of Solving a Polynomial Equation
Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
Curve-Sensitive Cuttings
Preemptive Ensemble Motion Planning on a Tree
A Polynomial Time Complexity Bound for Computations on Curves
Low-Distortion Inference of Latent Similarities from a Multiplex Social Network
On Minimal-Time Solutions of Firing Squad Synchronization Problems for Networks
Minimal-Comparison 2, 3-Trees
On Bounded Right Context Languages and Grammars
Edge-Disjoint Paths in Expander Graphs
Parameterized Approximation Scheme for the Multiple Knapsack Problem
WDM Switching Networks, Rearrangeable and Nonblocking [ w, f ]-connectors
A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph
An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
Unit Capacity Maxflow in Almost $m^{4/3}$ Time
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
On Multiplicative Lambda-Approximations and Some Geometric Applications
Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree
On Finding the Rectangular Duals of Planar Triangular Graphs
The Rectilinear Steiner Arborescence Problem Is NP-Complete
An Efficient Approximation Scheme for Variable-Sized Bin Packing
Half-integrality, LP-branching, and FPT Algorithms
Corrigendum: A New Representation of the Rational Numbers for Fast Easy Arithmetic
On the Complexity of Negation-Limited Boolean Networks
Three Fast Algorithms for Four Problems in Stable Marriage
Containment and Optimization of Object-Preserving Conjunctive Queries
Hardness of Precedence Constrained Scheduling on Identical Machines
O(M*N) Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
Computing Powers in Parallel
Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions
Soft Heaps Simplified
Navigation in Hypertext Is Easy Only Sometimes
A Minimum Linear Arrangement Algorithm for Undirected Trees
RSA and Rabin Functions: Certain Parts are as Hard as the Whole
Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
Queueing Analysis of a Multiprogrammed Computer System Having a Multilevel Storage Hierarchy
Supercritical Space-Width Trade-offs for Resolution
Exponential Separation of Communication and External Information
Efficient Noninteractive Proof Systems for Bilinear Groups
Almost Tight Bounds for Reordering Buffer Management
Optimal Impartial Selection
Listing and Counting Subtrees of a Tree
Complexity-Restricted Advice Functions
The Equivalence of Two Semantic Definitions: A Case Study in LCF
Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines
The Complexity of Computing a Nash Equilibrium
Oblivious Polynomial Evaluation
The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
The Sublogarithmic Alternating Space World
Domino Games and Complexity
Linearization and Completeness Results for Terminating Transitive Closure Queries on Spatial Databases
Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete
Fast Distributed Agreement
Correctness of Gossip-Based Membership under Message Loss
Some Observations on Parallel Algorithms for Fast Exponentiation in GF(2^n)
Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions
Cluster Before You Hallucinate: Node-Capacitated Network Design and Energy Efficient Routing
Some 3CNF Properties Are Hard to Test
Constructing Huffman Trees in Parallel
Uniform Hashing in Constant Time and Optimal Space
The Discrete Geodesic Problem
Derivation Complexity in Context-Free Grammar Forms
Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation
Representations and Parallel Computations for Rational Functions
Equational Bases for If-Then-Else
Intractability of Clique-Width Parameterizations
Optimal Online Algorithms for Multidimensional Packing Problems
The Spectra of Infinite Hypertrees
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones
On Circuit-Size Complexity and the Low Hierarchy in NP
Searching Semisorted Tables
Hardness Amplification Proofs Require Majority
Row-Major Sorting on Meshes
On the Validity of the Direct Sum Conjecture
Alternating Pushdown and Stack Automata
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
Almost-Optimal Gossip-Based Aggregate Computation
Minimal NFA Problems are Hard
On Approximating the Depth and Related Problems
Optimal CUR Matrix Decompositions
Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
Line Transversals of Convex Polyhedra in R 3
Polynomial Algorithms for Deterministic Pushdown Automata
Tight Worst-Case Performance Bounds for Next-k-Fit Bin Packing
Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
How to Use Indistinguishability Obfuscation: Deniable Encryption, and More
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
Optimal Mixed Graph Augmentation
Finding All the Elementary Circuits of a Directed Graph
Kakeya Sets, New Mergers, and Old Extractors
An Algorithmic Proof of the Lovász Local Lemma via Resampling Oracles
Approximation Algorithms for Data Placement Problems
Strictly Nonblocking WDM Cross-connects
Query-to-Communication Lifting Using Low-Discrepancy Gadgets
Bipartite Perfect Matching is in Quasi-NC
Arboricity and Subgraph Listing Algorithms
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
Equality-Test and If-Then-Else Algebras: Axiomatization and Specification
Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
On Three-Dimensional Packing
The Tree Model for Hashing: Lower and Upper Bounds
Some NP-Complete Problems Similar to Graph Isomorphism
Quality Meshing with Weighted Delaunay Refinement
Generating Bracelets in Constant Amortized Time
Computing the Median with Uncertainty
Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication
Floor-Planning by Graph Dualization: 2-Concave Rectilinear Modules
On the Variance of the Height of Random Binary Search Trees
Parallel Suffix-Prefix-Matching Algorithm and Applications
Exponential Determinization for omega-Automata with a Strong Fairness Acceptance Condition
Counting Complexity of Solvable Black-Box Group Problems
Lexicographical Generation of a Generalized Dyck Language
PP is as Hard as the Polynomial-Time Hierarchy
The Complexity of Multiterminal Cuts
Corrigendum: A Family of Algorithms for Powering Sparse Polynomials
A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution
The Chow Parameters Problem
Tighter Upper Bounds on the Exact Complexity of String Matching
Robust Geometric Spanners
Improved Combinatorial Algorithms for Facility Location Problems
Stateless Distributed Gradient Descent for Positive Linear Programs
Oracles for Distances Avoiding a Failed Node or Link
The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random
On the Accepting Density Hierarchy in NP
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
Turning Big Data Into Tiny Data: Constant-Size Coresets for k-Means, PCA, and Projective Clustering
Transitive Orientations of Graphs
Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is NP-Complete
Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
Approximating the Radii of Point Sets
The Pattern Matrix Method
The Stretch Factor of the Delaunay Triangulation Is Less than 1.998
A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
Testing Symmetric Properties of Distributions
Finite State Representations of Discrete Optimization Problems
A Quadratic Time Algorithm for the Minimax Length Triangulation
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization
The Organ Pipe Permutation
The Simplex Algorithm in Dimension Three
Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
Easily Checked Generalized Self-Reducibility
Complexity Results for First-Order Two-Variable Logic with Counting
Testing Halfspaces
The Wake-Up Problem in MultiHop Radio Networks
Preservation under Extensions on Well-Behaved Finite Structures
Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
Height Restricted Optimal Binary Trees
On Interpolation and Automatization for Frege Systems
On the Complexity of Package Recommendation Problems
Time Hierarchies for Sampling Distributions
A Short-Term Neural Network Memory
Closeness of NP-Hard Sets to Other Complexity Classes
Nearly Optimal Static Las Vegas Succinct Dictionary
Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2)
Uncoordinated Two-Sided Matching Markets
Identifying the Minimal Transversals of a Hypergraph and Related Problems
A Fast Parallel Horner Algorithm
Alphabetic Minimax Trees of Degree at Most t
Priority Search Trees
Dynamic Trees and Dynamic Point Location
Checking Approximate Computations of Polynomials and Functional Equations
Tests for Permutation Polynomials
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time
Distributed Processor Scheduling and User Countermeasures
A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application
New Bounds on the Complexity of the Shortest Path Problem
An Analysis of the Rational Exponential Integral
Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
Natural Proofs versus Derandomization
Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs
External Internal Nodes in Digital Search Trees via Mellin Transforms
The Minimum Euclidean-Norm Point in a Convex Polytope: Wolfe's Combinatorial Algorithm is Exponential
Efficient Parallel Pseudorandom Number Generation
Hypercubic Sorting Networks
Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification
An O(E log E + I) Expected Time Algorithm for the Planar Segment Intersection Problem
On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem
If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
Perfect Sampling in Infinite Spin Systems Via Strong Spatial Mixing
The Equivalence Problem for Single-Valued Two-Way Transducers (on NPDT0L Languages) is Decidable
Efficient Algorithms for Geometric Graph Search Problems
Optimal Simulations between Unary Automata
Distributed Computing by Mobile Robots: Gathering
Predicting the Number of Distinct Elements in a Multiset
Optimal Bin Packing with Items of Random Sizes II
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
On the Relationship Between Clique-Width and Treewidth
Computing a Face in an Arrangement of Line Segments and Related Problems
Soundness and Completeness of an Axiom System for Program Verification
Isomorphism Testing of Unary Algebras
On Earthmover Distance, Metric Labeling, and 0-Extension
Online List Labeling: Breaking the \({\log^2 n}\) Barrier
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
Equivalences and Separations Between Quantum and Classical Learnability
An Optimal Algorithm for the Maximum Three-Chain Problem
Movement Problems for 2-Dimensional Linkages
Smart SMART Bounds for Weighted Response Time Scheduling
Separation Between Deterministic and Randomized Query Complexity
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to Online Indexing
Information-Theoretically Secure Protocols and Security under Composition
On the Asymptotic Complexity of Matrix Multiplication
Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
The Complexity and Distribution of Hard Problems
Algorithmic approaches to setup minimization
An Average Time Analysis of Backtracking
Theoretical Aspects of VLSI Pin Limitations
Optimal Homologous Cycles, Total Unimodularity, and Linear Programming
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs