Informatics Laboratory[ order by time]
[ order by categories ]
[ order by authors]
2012.- Trading GRH for algebra: algorithms for factoring polynomials and related structures
2011.- Multivalued generalizations of the Frankl-Pach Theorem
- City sentinel - VAST 2011 mini challenge 1 award: "Outstanding integration of computational and visual methods".
- Efficient multi-start strategies for local search algorithms.
- Blocking sets in projective spaces
Authors: Blokhuis, Aart; Sziklai , Péter; Szőnyi, TamásDate: 2011.
- Longitudinal Analytics on Web Archive Data: It's About Time!
Authors: Weikum, Gerhard ; Ntarmos, Nikos ; Spaniol, Marc ; Triantafillou, Peter ; Benczúr, András; Scott , Kirkpatrick; Rigaux, Philippe ; Williamson, Mark Date: 2011.
- Affordable supercomputing for data mining applications.
- Web spam classification: a few features worth more.
- SZTAKI @ ImageCLEF 2011.
- Longitudinal analytics on web archive data: it's about time!
Authors: Weikum, G.; Ntarmos, N.; Spaniol, M.; Triantafillou, P.; Benczúr, András; Kirkpatrick, S.; Rigaux, P.; Williamson, M.Date: 2011.
- Entity resolution with heavy indexing.
- Temporal analysis for web spam detection: an overview.
- Infrastructures and bound for distributed entity resolution.
2010.- IMO2010 Shortlisted Problems
 Authors: Yerzhan, Baissalov; Ilya, Bogdanov; Kós, Géza; Nairi, Sedrakyan; Damir, Yeliussizov; Kuat, YessenovDate: 2010. 07. 15.
- Nonparametric sequental prediction of time series
Authors: Biau, Gérard; Blekley, Kevin; Györfi, László; Ottucsák, GyörgyDate: 2010. 04.
- Lehet egy közelítéssel kevesebb?
- SZTAKI @ TRECVID 2010
- Interest point and segmentation-based photo annotation.
- Consistent Nonparamtric Tests of Independence
- SZTAKI @ TREC 2010
- Reticular alignment: a progressive corner-cutting method for multiple sequence alignment.
- RNA Structure Prediction
- Journal of Computational Biology
- A simple Havel-Hakimi type algorithm to realize graphical degree sequences of directed graphs
- The Metropolized Partial Importance Sampling MCMC mixes slowly on minimum reversal rearrangement paths
- MCMC network: graphical interface for Bayesian analysis of metabolic networks.
- Introduction to Algorithms in Bioinformatics
2009.- Digital video event detector framework for surveillance applications.
- Schemes for deterministic polynomial factoring.
Authors: Ivanyos, Gábor; Karpinski, Marek; Saxena, NitinEditor: Johnson, J.; Park, H.; Kaltofen, E.Date: 2009. 07. 28.Download article: [html]
- Tetraéderek közös belső ponttal, avagy egy Kürschák-feladat utóélete.
- Reconstruction of matrices from submatrices.
Authors: Kós, Géza; Ligeti, Péter; Sziklai, PéterDate: 2009.Download article: [html]
- The rank of the endomorphism monoid of a uniform partition.
- SZTAKI@ImageCLEF 2008: visual feature analysis in segmented images.
- Reasoning methods for designing and surveying relationships described by sets of functional constraints
- Algebraic properties of modulo q complete l-wide families.
Authors: Felszeghy , Bálint; Hegedűs , Gábor; Rónyai, LajosDate: 2009.
- Telephone call network data mining: a survey with experiments.
- On the black-box complexity of Sperner's Lemma.
Authors: Friedl, Katalin; Ivanyos, Gábor; Santha, Miklos; Verhoeven, Yves F.Date: 2009.Download article: [html]
- Some meeting points of Gröbner bases and combinatorics.
- Generic entity resolution in relational databases.
- Directions in AG(2,p^2)
- SZTAKI @ ImageCLEF 2009
- Efficient sampling of parsimonious inversion histories with application to genome rearrangement in Yersinia.
- BigFoot: Bayesian Alignment and Phylogenetic Footprinting with MCMC BMC
Authors: Satija, R.; Novák, Á.; Miklós, István; Lyngsoe, R; Hein, J.Date: 2009.
- Streamlining and large ancestral genomes in Archaea inferred with a phylogenetic birth-and-death model
- Stochastic models of sequence evolution including insertion-deletion events.
Authors: Miklós, István; Novák, Á.; Satija, R.; Lyngsoe, R.; Hein, J.Date: 2009.
- Performance of auctions and sealed bids
- Degree-based graph construction.
Authors: Kim , P.; Toroczkai, Z.; Erdős, P.; Miklós, István; Székely, L.Date: 2009.
- Kapcsolatok és távolságok: a hazai vezetékes hívás-szokások elemzése.
- Linked latent dirichlet allocation in web spam filtering.
- Web spam filtering in internet archives.
- Web spam challenge proposal for filtering in archives.
- Flitter Mini Challenge Prize Winner: Good Analytical Debrief. Visualized Subgraph Search.
- KDD Cup 2009 @ Budapest: feature partitioning and boosting
- Elekes György polinomokkal kapcsolatos kombinatorikai eredményeiről.
2008.- Simple Lie algebras having extremal elements.
Authors: Cohen, Arjeh M.; Ivanyos, Gábor; Roozemond, DanDate: 2008.Download article: [html]
- On solving systems of random linear disequations.
- Intransitive Cartesian decompositions preserved by innately transitive permutation groups.
- Primitive flag-transitive generalized hexagons and octagons.
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups.
- Cross-language retrieval with wikipedia.
- Overview of the imageCLEF 2007 object retrieval task.
Authors: Deselaers, Thomas ; Hanbury, Allan; Viitaniemi, Ville ; Benczúr, András; Brendel, Mátyás; Daróczy, Bálint Zoltán; Balderas, Hugo Jair Escalante; Gevers, Theo ; Gracidas, Carlos Arturo Hernández ; Hoi, Steven C. H. ; Laaksonen, Jorma ; Li, Mingjing ; Castro, Heidy Marisol Marin ; Ney, Hermann ; Rui, Xiaoguang ; Sebe, Nicu ; Stöttinger, Julian ; Wu, Lei Date: 2008.
- Web Spam Hunting @ Budapest
- Multimodal retrieval by text--segment biclustering.
- IMO2008 Shortlisted Problems
Authors: Vicente Munoz, Velazquez; Juan Manuel Conde, Calero; Kós, Géza; Marcin, Kuczma; Ignasi Mundet, Rivera; Svetoslav, SavchevDate: 2008.
- Random-order bin packing.
Authors: Coffman, Edward G.; Csirik, János; Rónyai, Lajos; Zsbán, AmbrusDate: 2008.
- Ferenc Kárteszi (1907--1989): a short biography.
- Affinely regular polygons in an affine plane.
- Periodic decomposition of integer valued functions.
Authors: Károlyi, Gyula; Keleti, Tamás; Kós, Géza; Ruzsa, I.Z.Date: 2008.
- Two Turán type inequalities.
- Random constructions and density results.
- Graphs with the n-e.c. adjacency property constructed from affine planes.
Authors: Baker, Catherine A.; Bonato, Anthony; Brown, Julia M. Nowlin; Szőnyi, TamásDate: 2008.
- On the Hilbert function of complementary set families.
- Moment matrices, trace matrices and the radical of ideals.
Authors: Janovitz-Freireich, Itnuit; Mourrain, Bernard; Rónyai, Lajos; Szántó , ÁgnesEditor: Sendra, J. R.; Gonzales-Vega, L.Date: 2008.
- Constructions for quantum computing with symmetrized gates.
- Latent dirichlet allocation in web spam filtering.
- A comparative analysis of latent variable models for web page classification.
- Strongly consistent model selection for densities.
- Quantization for nonparametric regression.
- Graphs representimg sets of functional dependencies.
- Functional dependencies distorted by errors.
- Nonparametric nearest neighbor based empirical portfolio selection strategies.
- Growth optimal investment with transaction costs.
- ALT 2008. 19th international conference on algorithmic learning theory. Budapest, 2008. (Lecture notes in artificial intelligence 5254.)
Editor: Freund, Y.; Györfi, László; Turán, G.; Zeugmann, T.Date: 2008.
- Deformable polygon representation and near-mincuts.
Authors: Benczúr, András; Goemans, Michel X.Editor: Grötschel, M.; Katona, G.O.H.Date: 2008.
- Nonparametric independence tests: space partitioning and kernel approaches.
- Statistical multiple alignment.
- SimulFold: simultaneously inferring RNA structures including pseudoknots, alignments, and trees using a Bayesian MCMC framework.
- SZTAKI @ ImageCLEF 2008 visual concept detection.
- Web spam: a survey with vision for the archivist.
- Large-scale principal component analysis on LiveJournal friends network.
- Annotating documents by Wikipedia concepts
Authors: Schönhofen, PéterDate: 2008.Download article: [pdf]
- Increasing cluster recall of cross-modal image retrieval.
- StatAlign: an extendable software package for joint Bayesian estimation of alignments and evolutionary trees.
Authors: Novák, Ádám; Miklós, István; Lyngso, Rune; Hein, JotunDate: 2008.
- How reliably can we predict the reliability of protein structure predictions?
Authors: Miklós, István; Novák, Ádám; Dombai, Balázs; Hein, JotunDate: 2008.
- Dynamics of genome rearrangement in bacterial populations.
- Stochastic Models of Sequence Evolution including Insertion-Deletion events Statistical Methods in Medical Research
Authors: Miklós, István; Novák, Á; Satija, R; Lyngsoe, R; Hein, JDate: 2008.
- Primal-dual approach for directed vertex connectivity augmentation and generalizations.
2007.- Cross-modal retrieval by text and image feature biclustering.
- Computing approximate radicals using Bezoutians.
Authors: Janovitz-Freireich, Itnuit; Mourrain , Bernard; Rónyai, Lajos; Szántó , ÁgnesDate: 2007.Download article: [pdf]
- Gröbner bases for complete l-wide families.
Authors: Friedl, Katalin; Hegedűs, Gábor; Rónyai, LajosDate: 2007.
- Approximate Radical for Clusters: A Global Approach Using Gaussian Elimination or SVD
Authors: Janovitz-Freireich, Itnuit; Szántó , Ágnes; Rónyai, LajosDate: 2007.
- Semi-supervised learning: a comparative study for web spam and telephone user churn.
- Algorithms of Bioinformatics
- Performing cross-language retrieval with wikipedia.
- Overview of the imageCLEF 2007 object retrieval task.
Authors: Deselaers, Thomas; Hanbury, Allan; Viitaniemi, Ville; Benczúr, András; Brendel, Mátyás; Daróczy, Bálint Zoltán; Balderas, Hugo Jair Escalante; Gevers, Theo; Gracidas, Carlos Arturo Hernández; Hoi, Steven C. H.; Laaksonen, Jorma; Li, Mingjing; Castro, Heidy Marisol Marin; Ney, Hermann; Rui, Xiaoguang; Sebe, Nicu; Stöttinger, Julian; Wu, LeiEditor: Nardi, A.; Peters, C.; Quochi, V.Date: 2007.Download article: [pdf ]
- Who rated what: a combination of SVD, correlation and frequent sequence mining.
- On multiple blocking sets in Galois planes
Authors: Blokhuis, Aart; Lovász, László; Storme, Leo; Szőnyi, TamásDate: 2007.
- An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups.
Authors: Ivanyos, Gábor; Sanselme, Luc; Santha, MiklosEditor: Weil, W.T.Date: 2007.Download article: [html]
- Root shadow spaces.
- Kernel-based semi-log-optimal empirical portfolio selection strategies.
- Deciding universality of quantum gates.
- The derived series of a finite p-group.
- Egy érdekes és egyszerű transzformációval származtatott nem-desarguesi affin sík.
- Three types of inclusions of innately transitive permutation groups into wreath products in product action.
- Quasiprimitive groups and blow-up decompositions.
- Methods for large scale SVD with missing values.
- Spectral clustering in telephone call graphs.
- IMO2007 Shortlisted Problems
Authors: Huy Khoai, Ha; Ilya, Bogdanov; Nam Dung, Tran; Tuan Hoa, Le; Kós, GézaDate: 2007.
- Approximate radical of ideals with clusters of roots.
Authors: Janovitz-Freireich, Itnuit; Rónyai, Lajos; Szántó, ÁgnesDate: 2007.
- Poisson limit of an inhomogeneous nearly critical INAR(1) model.
Authors: Györfi, László; Ispány, Márton; Pap, Gyula; Varga, KatalinDate: 2007.
- KDD Cup 2007 task 1 winner report
- Bioinformatics.
- Relational database design.
- Algebra.
- Impact of non-Poissonian activity patterns on spreading processes.
Authors: Vazquez, A.; Rácz, B.; Lukács, András; Barabási, A.-L.Date: 2007.
- Principles of stability analysis for random accessing with feedback.
- Coding for multiple-access collision channel without feedback.
- Sequential prediction of unbounded stationary time series.
- The on-line shortest path problem under partial monitoring.
- Web spam detection via commercial intent analysis.
- Sequential prediction of binary sequence with side information only.
- Relációs adatbázisok funkcionális függőségi rendszereinek grafikus axiomatizációja.
- Nonparametric estimation of conditional distributions.
- Multiple access channels. Theory and practice. (NATO security through science series, D. 10.)
- KDD cup 2007 task 1 winner report.
- Query rewriting in relational databases.
2006.- Root filtration spaces from Lie algebras and abstract root groups
- On the lexicographic standard monomials of zero dimensional ideals
- Note on disjoint blocking sets in Galois planes
Authors: Barát, János; Marcugini, S; Pambianco, F; Szőnyi, TamásDate: 2006.
- Learning near-optimal policies with Bellman-residual minimization based fitted policy iteration and a single sample path

- Nonparametric kernel-based sequential investment strategies
- Standard monomials for partitions
- The lex game and some applications
Authors: Felszeghy, Bálint; Ráth, Balázs; Rónyai, LajosDate: 2006.
- Innately transitive subgroups of wreath products in product action
- Small derived quotients in finite p-groups
- Approximate radical of ideals with clusters of roots
Authors: Janovitz-Freireich, I; Rónyai, Lajos; Szántó, ÁEditor: Dumas, JGDate: 2006.
- Locally 2-dimensional Sperner problems complete for the polynomial parity argument classes
Authors: Friedl, K; Ivanyos, Gábor; Santha, M; Verhoeven, YFDate: 2006.Download article: [html]
- Hannan consistency in on-line learning in case of unbounded losses under partial monitoring

- On the number of independent functional dependencies
- Detecting nepotistic links by language model disagreement
- Exploiting extremely rare features in text categorization
- To randomize or not to randomize: space optimal summaries for hyperlink analysis
- Shaping SQL-based frequent pattern mining algorithms
- Dynamics of information access on the web
- PageRank és azon túl: Hiperhivatkozások szerepe a keresésben
- Improved approximation algorithms for large matrices via random projections
- Impact of non-Poisson activity patterns on spreading processes
- Link-based similarity search to fight web spam
- Two-phase data warehouse optimized for data mining
- Identifying document topics using the wikipedia category network
- Relációs adatbázisok funkcionális függőségi rendszereinek grafikus axiomatizációja
Authors: Demetrovics, János; Molnár, András; Thalheim, Bernhard Date: 2006.
2005.- Klaszterezés
- Formal methods in computing
Authors: Ferenczi, M; Rónyai, L; Pataricza, ADate: 2005.
- Scaling link-based similarity search
- Efficient testing of groups
Authors: Friedl, K; Ivanyos, G; Santha, MDate: 2005.
- Analysis of collision channel with asynchronous access
- On the black-box complexity of Sperner's Lemma
Authors: Friedl, K; Ivanyos, G; Santha, M; Verhoeven, YFDate: 2005.
- On defining sets for projective planes
Authors: Boros, E; Szőnyi, T; Tichler, KDate: 2005.
- On the asymptotic properties of a nonparametric L_1-test statistic of homogeneity
- Improved minimax bounds on the test and training distortion of empirically designed vector quantizers

- Generalised sifting in black-box groups
Authors: Ambrose, S; Neunhöffer, M; Praeger, ChE; Schneider, CsDate: 2005.
- Improved minimax bounds on the test and training distortion of empirically designed vector quantizers
- Individual convergence rates in empirical vector quantizer design
- SpamRank - fully automatic link spam detection. Work in progress
- On the feasibility of low-rank approximation for personalized pagerank
- Convergence rates in higher order Markov modeling of block-Markov sources
- Limited-delay coding of individual sequences with piecewise different behavior
- Feature selection based on word-sentence relation
- A computer-based approach to the classification of nilpotent Lie algebras
- Shaping SQL-based frequent pattern mining algorithms
- On large minimal blocking sets in PG(2,q)
Authors: Szőnyi, T; Cossidente, A; Gács, A; Mengyán, Cs; Alessandro, S; Weiner, ZsDate: 2005.
- Standard monomials of some symmetric sets
- Primal-dual approach for directed vertex connectivity augmentation and generalizations
- Efficient algorithms
- Design of sample adaptive product quantizers for noisy channels
Authors: Raza, Z; Alajaji, F; Linder, TDate: 2005.
- Tracking the best quantizer
- Tracking the best of many experts
- Algebra
- Quantum computing on lattices using global two-qubit gates
- On benchmarking frequent itemset mining algorithms: from measurement to analysis
Authors: Rácz, B; Bodon, F; Schmidt-Thieme, LDate: 2005.Download presentation: [ppt]Download article: [pdf]
- Generating random elements of abelian groups
- Towards scaling fully personalized pageRank
2004.- Minkowski arrangements of spheres
Authors: Böröczky, K; Szabó, LDate: 2004.
- On the spectrum of pairwise comparison matrices
Authors: Farkas, A; György, A; Rózsa, PDate: 2004.
- A scalable randomized method to compute link-based similarity rank on the web graph
- Magyar nyelvű tartalom a világhálón
- Transitive simple subgroups of wreath products in product action
- Improved convergence rates in empirical vector quantizer design
- Nemparaméteres függvénybecslések
- Ranking the pages of the world wide web
- Towards scaling fully personalized pageRank
- High density compression of log files
- nonordfp: an FP-growth variation without rebuilding the FP-tree
Authors: Rácz, BDate: 2004.Download presentation: [ppt]Download article: [pdf]
- Sentence-based document size reduction
- Gröbner bases for permutations and oriented trees
- Efficient algorithms and minimax bounds for zero-delay lossy source coding
- A 'follow the perturbed leader'-type algorithm for zero-delay quantization of individual sequences
- Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding
- An inductive construction for plane Laman graphs via vertex splitting
Authors: Fekete, Zsolt; Jordán, Tibor; Whiteley, WalterDate: 2004.Download article: [pdf]
2003.- Algorithms on the Web graph
- Dependencies and generalized relations
- Ranking the pages of the World Wide Web
- Where to start browsing the Web
- Hidden translation and orbit coset in quantum computing
Authors: Friedl, K; Ivanyos, G; Magniez, F; Santha, M; Sen, PDate: 2003.
- Mi mennyi?
Authors: Csörgő, S; Rónyai, L; Ruzsa, IDate: 2003.
- Arrangements of 14, 15, 16 and 17 points on a sphere
Authors: Böröczky, K; Szabó, LDate: 2003.
- Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems
- Formal description of a distributed location service for mobile ad hoc networks
Authors: Benczúr, A; Glasser, U; Lukovszki, TDate: 2003.
- Searching a small national domain - preliminary report
- Trie: an alternative datastructure for datamining
- Arrangements of 13 points on a sphere
Authors: Böröczky, K; Szabó, LDate: 2003.
- Order shattering and Wilson's theorem
- Keresés a világhálón
Authors: Friedman, E; Uher, M; Windhager, EDate: 2003.
- On a conjecture of László Rédei
- Birkózás a bonyolultsággal
- Kombinatorikus geometria és geometriai algoritmusok. (Polygon könyvtár)
- On maximal partial spreads
- On sets without tangents in planes of even order
Authors: Blokhuis, Aart; Szőnyi, Tamás; Weiner, ZsuzsaDate: 2003.
- Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem
Authors: Ivanyos, G; Magniez, F; Santha, MDate: 2003.
- Standard monomials for q-uniform families and a conjecture of Babai and Frankl
- Codecell convexity in optimal entropy-constrained vector quantization
- A magyar web
Authors: Friedman, E; Uher, M; Windhager, EDate: 2003.
- Codecell convexity in optimal entropy-constrained vector quantization
- Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?
- Gröbner bases for complete uniform families
- On the spectrum of minimal blocking sets
Authors: Szőnyi, Tamás; Gács , András; Weiner , ZsuzsaDate: 2003.
2002.- Véges projektív síkok.
Authors: Bérzci, G; Gács, A; Szőnyi, TDate: 2002.
- Véges projektív síkok.
Authors: Bérzci, G; Gács, A; Hraskó, A; Szőnyi, TDate: 2002.
- Hibajavító kódok
- Minkowski arrangements of circles in the plane.
Authors: Böröczky, K; Szabó, LDate: 2002.
- Clouds of planar convex bodies.
Authors: Szabó, L; Ujváry-Menyhárt, ZDate: 2002.
- Shattering news.
Authors: Anstee, RP; Rónyai, L; Sali, ADate: 2002.
- Algebra and computation at SZTAKI.
- Regular sphere packings.
Authors: Harborth, H; Szabó, L; Ujváry-Menyhárt, ZDate: 2002.
- Lower bounds for the rate of convergence in nonparametric pattern recognition.
- On nonparametric estimates of the expectation.
- Prediction from randomly right censored data.
Authors: Kohler, M; Máté, K; Pintér, MDate: 2002.
- On the rate of convergence of error estimates for the partitioning classification rule.
- Minkowski arrangements of circles in the plane
Authors: Böröczky, K; Szabó, LDate: 2002.
- A note on the existence of optimal entropy-constrained vector quantizers.
- On the structure of optimal entropy-constrained scalar quantizers.
- Data-dependent margin-based generalization bounds for classification.
- Convergence properties of functional estimates for discrete distributions.
Authors: Antos, A; Kontoyiannis, IDate: 2002.
- A note on robust hypothesis testing.
- On embedding large (k,n)-arcs and partial unitals
2001.- Newton numbers for overlapping circular discs.
Authors: Harborth, H; Koch, M; Szabó, LDate: 2001.
- Disjoint empty convex polygons in planar point sets.
- Estimating the entropy of discrete distributions.
Authors: Antos, A; Kontoyiannis, IDate: 2001.
- Deciding finiteness for matrix semigroups over function fields over finite fields.
- Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem.
Authors: Ivanyos, G; Magniez, F; Sántha, MDate: 2001.
- On the number of zero-patterns of a sequence of polynomials.
Authors: Rónyai, L; Babai, L; Ganapathy, MKDate: 2001.
- Finite contractions of graphs with polynomial growth.
- Relative Newton numbers of regular polygons with equal side lengths.
Authors: Kemnitz, A; Szabó, LDate: 2001.
- Maximal facet-to-facet snakes of unit cubes.
Authors: Szabó, L; Ujvári-Menyhárt, ZDate: 2001.
2000.- Treating the exceptional cases of the MeatAxe.
- A combinatorial problem on polynomials and rational functions.
- Augmenting undirected edge connectivity in Ő(n2) time.
- Lower bounds on the rate of convergence of nonparametric regression estimates.
- Protecting regular polygons.
Authors: Kemnitz, A; Szabó, L; Ujváry-Menyhárt, ZDate: 2000.
- On a conjecture of Kemnitz.
- Fast algorithms for even/odd minimum cuts and generalizations.
- Rawa trees.
Authors: Antos, A; Devroye, LDate: 2000.
- Fast randomized algorithms for the structure of matrix algebras over finite fields.
- Három halk visszhang.
- Finding splitting elements and maximal tori in matrix algebras.
1999.- Performance limits of nonparametric estimators
- Dilworth's theorem and its application for path systems of a cycle-implementation and analysis.
- Covering symmetric supermodular functions by graphs.
- Lower bounds on the rate of convergence of nonparametric pattern recognition.
- Lower bounds for Bayes error estimation.
- Algebrák és algoritmusok.
- Néhány kombinatorikus geometriai probléma.(Some problems in combinatorial geometry.).
- Norm-graphs: variations and applications.
- Parallel and fast sequential algorithms for undirected edge connectivity augmentation.
- On plus-minus 1-representations of integers.
- Finding the radical of matrix algebras using fitting decompositions.
- Egy igazán csudálatos bizonyítás. (A truly marvelous proof.) (in Hungarian.)
- Computations in associative and Lie algebras.
- On error estimation for the partitioning classification rule.
Authors: Horváth, M Editor: Fischer, P Date: 1999.
- Smallest limited vertex-to-vertex snakes of unit triangles.
Authors: Harborth, Z; Szabó, L; Ujvári-Menyhárt, HDate: 1999.
- Error estimation in pattern recognition.
- A simple randomized algorithm for sequential prediction of ergodic time series.
1998.- Augmenting undirected edge-connectivity in Ő(n2) time.
- Strong minimax lower bounds for learning.
- Periodical scheduling.
- Scale-sensitive dimensions and skeleton estimates for classification.
- On local expansion of vertex-transitive graphs.
- Lattices in graphs with polynomial growth.
- Algoritmusok.
1997.- Finding the radical of an algebra of linear transformations.
Authors: Cohen, AM; Ivanyos, G; Wales, DBDate: 1997.
- Computations in finite-dimensional Lie algebras.
Authors: Cohen, AM; De Graff, WA; Rónyai, LDate: 1997.
- Polynomial time algorithms for modules over finite dimensional algebras.
Authors: Christov, A; Ivanyos, G; Karpinski, MDate: 1997.
- Computing Levi decompositions in Lie algebras.
- Primitive illumination systems for families of convex bodies in the plane.
Authors: Soltan, V; Szabó, L; Vásárhelyi, ÉDate: 1997.
- A simple proof for the Jordan measurability of convex sets.
- Recent results on illumination problems.
- Konvex geometria. Egyetemi jegyzet.
1996.- Computing Cartan subalgebras in Lie algebras.
- Multiplicative equations over commuting matrices.
Authors: Babai, L; Beals, R; Cai, J-Y; Ivanyos, G; Luks, EMDate: 1996.
- Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs.
- Lattice basis reduction for indefinite forms and an application.
- Norm-graphs and bipartite Turán numbers.
- Klasszikus képtárproblémák II.
- Prime-field-complete functions and factoring polynomials over finite fields.
- Clones and maximal sets in set logic containing all Boolean functions.
- An illumination problem for convex polyhedra.
1995.- On the density of unit balls touching a unit cylinder
1994.- Decomposition of algebras over Fq(X1,...,Xm)
- A deterministic method for computing splitting elements in simple algebras over Q
- Fermat utolsó tétele
- Regular circle packings
1993.- Equality schemes and equality scheme dependencies in relational databases
- Functional dependencies among Boolean dependencies
- Finding maximal orders in semisimple algebras over Q
- Computations in associative algebras
1992.- ON THE COMPOSITION AND DECOMPOSITION OF ATTRIBUTES AND TUPLES
- Galois groups and factoring polynomials over finite fields
- A note on intersections of isotone clones
- Algorithmic properties of maximal orders in simple algebras over Q
- lliptikus görbék és Fermat-sejtés
|