International Journal of Foundations of Computer Science

Titel Veröffentlichungsdatum Sprache Zitate
A GRAPH BASED DAVIDSON ALGORITHM FOR THE GRAPH PARTITIONING PROBLEM1999/06/01English
A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS1999/06/01English
RESOURCE ESTIMATION ALGORITHM UNDER IMPRECISENESS USING INCLUSION SCHEDULING2001/10/01English
REMARKS ON A QUERY-BASED VARIANT OF THE PARALLEL REPETITION THEOREM2001/08/01English
REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS2001/02/01English
A NEW WEIGHT BALANCED BINARY SEARCH TREE2000/09/01English
PARALLEL MAXIMUM MATCHING ALGORITHMS IN INTERVAL GRAPHS1999/03/01English
USING STOCHASTIC INFORMATION TO PREDICT APPLICATION BEHAVIOR ON CONTENDED RESOURCES2001/06/01English
DFT TECHNIQUES FOR SIZE ESTIMATION OF DATABASE JOIN OPERATIONS1999/03/01English
VARIANTS OF (A,B)-TREES WITH RELAXED BALANCE2001/08/01English
MODELLING AND PERFORMANCE EVALUATION OF THE CIRCULATING MULTISEQUENCER, THE MULTI-TOKENS AND THE CONSENSUS ALGORITHMS IN A REAL TIME DISTRIBUTED TRANSACTIONAL SYSTEM2001/12/01English
THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES2002/02/01English
LOAD BALANCING IN HOME-BASED SOFTWARE DSMS2001/06/01English
APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD2000/12/01English
EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE2001/06/01English
SPECIAL ISSUE ON ADVANCES IN COMPUTING SCIENCE — ASIAN '982000/03/01English
BEYOND TAMAKI-SATO STYLE UNFOLD/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS2002/06/01English
ON THE COMPLEXITY OF SOME ADAPTIVE POLLING ALGORITHMS IN GENERAL NETWORKS1999/06/01English
LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS2001/02/01English
THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS2002/06/01English
SOME SUFFICIENT CONDITIONS OF LEARNABILITY IN THE LIMIT FROM POSITIVE DATA2000/09/01English
SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-ary INPUT RELATIONS2000/12/01English
MERGEABLE DOUBLE-ENDED PRIORITY QUEUES1999/03/01English
CLOSURE PROPERTY OF PROBABILISTIC TURING MACHINES AND ALTERNATING TURING MACHINES WITH SUBLOGARITHMIC SPACES2001/06/01English
ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES2001/08/01English
PERFORMANCE EVALUATION OF PRACTICAL PARALLEL COMPUTER MODEL LogPQ2001/06/01English
RANDOMIZED MOBILE AGENT BASED ROUTING IN WIRELESS NETWORKS2001/06/01English
HAIRPIN LANGUAGES2001/12/01English
THE DELAUNAY HIERARCHY2002/04/01English
NLC2-DECOMPOSITION IN POLYNOMIAL TIME2000/09/01English