Pages that link to "Item:Q2703009"

The following pages link to International Journal of Foundations of Computer Science (Q2703009):

Displaying 31 items.

• REACHABILITY FOR FINITE-STATE PROCESS ALGEBRAS USING HORN CLAUSES (Q2842001) (← links)
• TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES (Q2856011) (← links)
• STATE-SIZE HIERARCHY FOR FINITE-STATE COMPLEXITY (Q2909179) (← links)
• TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE (Q2929619) (← links)
• Anytime Algorithms for Non-Ending Computations (Q2947801) (← links)
• A Note on the Minimum H-Subgraph Edge Deletion (Q2947962) (← links)
• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING (Q3021938) (← links)
• INVOLUTIVELY BORDERED WORDS (Q3065618) (← links)
• <font>P</font>SYSTEMS WITH ACTIVE MEMBRANES WORKING IN POLYNOMIAL SPACE (Q3076598) (← links)
• MODELING DIFFUSION IN A SIGNAL TRANSDUCTION PATHWAY: THE USE OF VIRTUAL VOLUMES IN <font>P</font> SYSTEMS (Q3076601) (← links)
• UN-KLEENE BOOLEAN EQUATION SOLVING (Q3434274) (← links)
• SYMBOLIC IMPLEMENTATION OF ALTERNATING AUTOMATA (Q3503089) (← links)
• THE STRUCTURE OF FACTOR ORACLES (Q3503093) (← links)
• SUCCINCT MINIMAL GENERATORS: THEORETICAL FOUNDATIONS AND APPLICATIONS (Q3526975) (← links)
• ON SUCCINCT REPRESENTATION OF KNOWLEDGE COMMUNITY TAXONOMIES WITH FORMAL CONCEPT ANALYSIS (Q3526981) (← links)
• ENCODINGS OF MULTISETS (Q3636150) (← links)
• PRINCIPAL TYPE ASSIGNMENT TO LAMBDA TERMS (Q3988840) (← links)
• APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
• L(2,1)-Edge-Labelings of the Edge-Path-Replacement of a Graph (Q4639931) (← links)
• VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH (Q4902887) (← links)
• SOME LANGUAGES RECOGNIZED BY TWO-WAY FINITE AUTOMATA WITH QUANTUM AND CLASSICAL STATES (Q4902896) (← links)
• IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS (Q4923285) (← links)
• PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT (Q5248997) (← links)
• FINDING SMALL EQUIVALENT DECISION TREES IS HARD (Q5249043) (← links)
• APPROXIMATING THE NEAREST NEIGHBOR INTERCHARGE DISTANCE FOR NON-UNIFORM-DEGREE EVOLUTIONARY TREES (Q5249276) (← links)
• Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs (Q5384532) (← links)
• RESEARCH FRONTIERS OF MEMBRANE COMPUTING: OPEN PROBLEMS AND RESEARCH TOPICS (Q5404514) (← links)
• FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES (Q5483380) (← links)
• PLANAR CROSSING NUMBERS OF GRAPHS EMBEDDABLE IN ANOTHER SURFACE (Q5493891) (← links)
• A PTAS for Scheduling Unrelated Machines of Few Different Types (Q5895057) (← links)
• PREFACE (Q5965694) (← links)